./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p10.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p10.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 20c7fc3494b446055d3e4a2b30847fc411c91ac271aa2546e41eca4738b87081 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:15:40,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:15:40,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:15:40,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:15:40,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:15:40,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:15:40,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:15:40,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:15:40,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:15:40,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:15:40,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:15:40,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:15:40,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:15:40,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:15:40,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:15:40,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:15:40,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20c7fc3494b446055d3e4a2b30847fc411c91ac271aa2546e41eca4738b87081 [2025-02-05 20:15:40,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:15:40,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:15:40,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:15:40,805 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:15:40,805 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:15:40,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p10.c [2025-02-05 20:15:42,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6744b0d2/6593a14aebb1448fa710a15b19d590c3/FLAG22cda52e5 [2025-02-05 20:15:42,345 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:15:42,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p10.c [2025-02-05 20:15:42,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6744b0d2/6593a14aebb1448fa710a15b19d590c3/FLAG22cda52e5 [2025-02-05 20:15:42,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6744b0d2/6593a14aebb1448fa710a15b19d590c3 [2025-02-05 20:15:42,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:15:42,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:15:42,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:15:42,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:15:42,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:15:42,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:15:42" (1/1) ... [2025-02-05 20:15:42,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6a1aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:42, skipping insertion in model container [2025-02-05 20:15:42,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:15:42" (1/1) ... [2025-02-05 20:15:42,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:15:42,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p10.c[1259,1272] [2025-02-05 20:15:43,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:15:43,031 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:15:43,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p10.c[1259,1272] [2025-02-05 20:15:43,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:15:43,142 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:15:43,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43 WrapperNode [2025-02-05 20:15:43,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:15:43,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:15:43,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:15:43,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:15:43,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,415 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2751 [2025-02-05 20:15:43,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:15:43,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:15:43,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:15:43,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:15:43,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,528 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:15:43,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:15:43,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:15:43,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:15:43,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:15:43,716 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (1/1) ... [2025-02-05 20:15:43,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:15:43,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:15:43,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:15:43,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:15:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:15:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:15:43,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:15:43,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:15:43,991 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:15:43,992 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:15:46,545 INFO L? ?]: Removed 1738 outVars from TransFormulas that were not future-live. [2025-02-05 20:15:46,545 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:15:46,684 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:15:46,684 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:15:46,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:15:46 BoogieIcfgContainer [2025-02-05 20:15:46,685 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:15:46,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:15:46,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:15:46,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:15:46,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:15:42" (1/3) ... [2025-02-05 20:15:46,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4706fb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:15:46, skipping insertion in model container [2025-02-05 20:15:46,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:15:43" (2/3) ... [2025-02-05 20:15:46,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4706fb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:15:46, skipping insertion in model container [2025-02-05 20:15:46,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:15:46" (3/3) ... [2025-02-05 20:15:46,697 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p10.c [2025-02-05 20:15:46,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:15:46,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p10.c that has 1 procedures, 723 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:15:46,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:15:46,803 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;@9b6154f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:15:46,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:15:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 723 states, 721 states have (on average 1.4993065187239945) internal successors, (1081), 722 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 20:15:46,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:46,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:46,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:46,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 638021794, now seen corresponding path program 1 times [2025-02-05 20:15:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:46,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197742144] [2025-02-05 20:15:46,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:46,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:46,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 20:15:47,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 20:15:47,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:47,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:48,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-02-05 20:15:48,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197742144] [2025-02-05 20:15:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197742144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:48,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:48,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:15:48,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743745316] [2025-02-05 20:15:48,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:48,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:15:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:48,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:15:48,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:15:48,147 INFO L87 Difference]: Start difference. First operand has 723 states, 721 states have (on average 1.4993065187239945) internal successors, (1081), 722 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 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-02-05 20:15:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:48,734 INFO L93 Difference]: Finished difference Result 1391 states and 2083 transitions. [2025-02-05 20:15:48,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:15:48,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 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-02-05 20:15:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:48,756 INFO L225 Difference]: With dead ends: 1391 [2025-02-05 20:15:48,757 INFO L226 Difference]: Without dead ends: 722 [2025-02-05 20:15:48,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:15:48,765 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 0 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:48,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2686 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:15:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-02-05 20:15:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2025-02-05 20:15:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 1.4965325936199723) internal successors, (1079), 721 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1079 transitions. [2025-02-05 20:15:48,840 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1079 transitions. Word has length 141 [2025-02-05 20:15:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:48,841 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1079 transitions. [2025-02-05 20:15:48,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 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-02-05 20:15:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1079 transitions. [2025-02-05 20:15:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 20:15:48,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:48,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:48,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:15:48,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1691480949, now seen corresponding path program 1 times [2025-02-05 20:15:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255738274] [2025-02-05 20:15:48,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:48,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 20:15:49,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 20:15:49,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:49,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:49,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:49,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255738274] [2025-02-05 20:15:49,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255738274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:49,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:49,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:15:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508526442] [2025-02-05 20:15:49,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:49,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:15:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:49,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:15:49,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:15:49,493 INFO L87 Difference]: Start difference. First operand 722 states and 1079 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:49,928 INFO L93 Difference]: Finished difference Result 1392 states and 2081 transitions. [2025-02-05 20:15:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:15:49,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-02-05 20:15:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:49,932 INFO L225 Difference]: With dead ends: 1392 [2025-02-05 20:15:49,933 INFO L226 Difference]: Without dead ends: 724 [2025-02-05 20:15:49,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:15:49,935 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 0 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:49,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2683 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:15:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-02-05 20:15:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2025-02-05 20:15:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 1.4951590594744122) internal successors, (1081), 723 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1081 transitions. [2025-02-05 20:15:49,994 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1081 transitions. Word has length 142 [2025-02-05 20:15:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:49,996 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1081 transitions. [2025-02-05 20:15:49,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1081 transitions. [2025-02-05 20:15:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 20:15:49,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:49,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:49,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:15:49,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:50,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:50,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1035208125, now seen corresponding path program 1 times [2025-02-05 20:15:50,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:50,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768957312] [2025-02-05 20:15:50,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:50,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:50,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 20:15:50,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 20:15:50,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:50,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:50,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:50,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768957312] [2025-02-05 20:15:50,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768957312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:50,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:50,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:50,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998555437] [2025-02-05 20:15:50,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:50,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:50,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:50,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:50,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:50,882 INFO L87 Difference]: Start difference. First operand 724 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:51,331 INFO L93 Difference]: Finished difference Result 1402 states and 2094 transitions. [2025-02-05 20:15:51,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:51,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-02-05 20:15:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:51,338 INFO L225 Difference]: With dead ends: 1402 [2025-02-05 20:15:51,338 INFO L226 Difference]: Without dead ends: 732 [2025-02-05 20:15:51,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 20:15:51,341 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:51,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:15:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-02-05 20:15:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2025-02-05 20:15:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 729 states have (on average 1.4938271604938271) internal successors, (1089), 729 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1089 transitions. [2025-02-05 20:15:51,362 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1089 transitions. Word has length 143 [2025-02-05 20:15:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:51,363 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1089 transitions. [2025-02-05 20:15:51,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1089 transitions. [2025-02-05 20:15:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:15:51,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:51,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:51,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:15:51,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:51,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash 965335480, now seen corresponding path program 1 times [2025-02-05 20:15:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:51,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584072231] [2025-02-05 20:15:51,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:51,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:15:51,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:15:51,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:51,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584072231] [2025-02-05 20:15:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584072231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:52,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944943696] [2025-02-05 20:15:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:52,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:52,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:52,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:52,265 INFO L87 Difference]: Start difference. First operand 730 states and 1089 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:52,768 INFO L93 Difference]: Finished difference Result 1414 states and 2110 transitions. [2025-02-05 20:15:52,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:52,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2025-02-05 20:15:52,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:52,772 INFO L225 Difference]: With dead ends: 1414 [2025-02-05 20:15:52,773 INFO L226 Difference]: Without dead ends: 738 [2025-02-05 20:15:52,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 20:15:52,775 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:52,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:15:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-02-05 20:15:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2025-02-05 20:15:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 1.4925170068027211) internal successors, (1097), 735 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1097 transitions. [2025-02-05 20:15:52,797 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1097 transitions. Word has length 144 [2025-02-05 20:15:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:52,797 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1097 transitions. [2025-02-05 20:15:52,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1097 transitions. [2025-02-05 20:15:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 20:15:52,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:52,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:52,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:15:52,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:52,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1012068597, now seen corresponding path program 1 times [2025-02-05 20:15:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:52,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056507659] [2025-02-05 20:15:52,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:52,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 20:15:53,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 20:15:53,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:53,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:53,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:53,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056507659] [2025-02-05 20:15:53,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056507659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:53,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:53,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:53,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114177993] [2025-02-05 20:15:53,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:53,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:53,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:53,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:53,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:53,644 INFO L87 Difference]: Start difference. First operand 736 states and 1097 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:54,046 INFO L93 Difference]: Finished difference Result 1426 states and 2126 transitions. [2025-02-05 20:15:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:54,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-02-05 20:15:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:54,048 INFO L225 Difference]: With dead ends: 1426 [2025-02-05 20:15:54,049 INFO L226 Difference]: Without dead ends: 744 [2025-02-05 20:15:54,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 20:15:54,052 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:54,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:15:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-02-05 20:15:54,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2025-02-05 20:15:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.4912280701754386) internal successors, (1105), 741 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1105 transitions. [2025-02-05 20:15:54,071 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1105 transitions. Word has length 145 [2025-02-05 20:15:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:54,072 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1105 transitions. [2025-02-05 20:15:54,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:54,072 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1105 transitions. [2025-02-05 20:15:54,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:15:54,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:54,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:54,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:15:54,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1190201077, now seen corresponding path program 1 times [2025-02-05 20:15:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:54,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412255258] [2025-02-05 20:15:54,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:54,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:54,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:15:54,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:15:54,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:54,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412255258] [2025-02-05 20:15:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412255258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:54,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:54,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:54,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12536429] [2025-02-05 20:15:54,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:54,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:54,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:54,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:54,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:54,672 INFO L87 Difference]: Start difference. First operand 742 states and 1105 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:55,123 INFO L93 Difference]: Finished difference Result 1438 states and 2142 transitions. [2025-02-05 20:15:55,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:55,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-02-05 20:15:55,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:55,126 INFO L225 Difference]: With dead ends: 1438 [2025-02-05 20:15:55,126 INFO L226 Difference]: Without dead ends: 750 [2025-02-05 20:15:55,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 20:15:55,129 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:55,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:15:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-02-05 20:15:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2025-02-05 20:15:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 1.4899598393574298) internal successors, (1113), 747 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1113 transitions. [2025-02-05 20:15:55,150 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1113 transitions. Word has length 146 [2025-02-05 20:15:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:55,150 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1113 transitions. [2025-02-05 20:15:55,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1113 transitions. [2025-02-05 20:15:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 20:15:55,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:55,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:55,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:15:55,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:55,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash 224568242, now seen corresponding path program 1 times [2025-02-05 20:15:55,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:55,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060199177] [2025-02-05 20:15:55,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:55,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:55,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 20:15:55,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 20:15:55,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:55,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:55,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:55,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060199177] [2025-02-05 20:15:55,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060199177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:55,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:55,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:15:55,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498339652] [2025-02-05 20:15:55,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:55,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:15:55,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:55,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:15:55,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:15:55,827 INFO L87 Difference]: Start difference. First operand 748 states and 1113 transitions. Second operand has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:56,226 INFO L93 Difference]: Finished difference Result 1646 states and 2448 transitions. [2025-02-05 20:15:56,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:15:56,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-02-05 20:15:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:56,230 INFO L225 Difference]: With dead ends: 1646 [2025-02-05 20:15:56,230 INFO L226 Difference]: Without dead ends: 952 [2025-02-05 20:15:56,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:15:56,232 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 173 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:56,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 3788 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:15:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-02-05 20:15:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 949. [2025-02-05 20:15:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 1.4862869198312236) internal successors, (1409), 948 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1409 transitions. [2025-02-05 20:15:56,250 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1409 transitions. Word has length 147 [2025-02-05 20:15:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:56,250 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1409 transitions. [2025-02-05 20:15:56,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1409 transitions. [2025-02-05 20:15:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 20:15:56,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:56,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:56,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:15:56,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 260044187, now seen corresponding path program 1 times [2025-02-05 20:15:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:56,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814745950] [2025-02-05 20:15:56,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:56,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 20:15:56,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 20:15:56,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:56,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:56,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:56,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814745950] [2025-02-05 20:15:56,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814745950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:56,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:56,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:56,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961258067] [2025-02-05 20:15:56,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:56,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:56,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:56,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:56,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:56,756 INFO L87 Difference]: Start difference. First operand 949 states and 1409 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:57,096 INFO L93 Difference]: Finished difference Result 1860 states and 2762 transitions. [2025-02-05 20:15:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:57,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-02-05 20:15:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:57,100 INFO L225 Difference]: With dead ends: 1860 [2025-02-05 20:15:57,100 INFO L226 Difference]: Without dead ends: 965 [2025-02-05 20:15:57,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 20:15:57,101 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:57,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3568 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:15:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2025-02-05 20:15:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 961. [2025-02-05 20:15:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 1.484375) internal successors, (1425), 960 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1425 transitions. [2025-02-05 20:15:57,114 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1425 transitions. Word has length 148 [2025-02-05 20:15:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:57,114 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1425 transitions. [2025-02-05 20:15:57,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1425 transitions. [2025-02-05 20:15:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 20:15:57,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:57,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:57,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:15:57,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:57,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1073104175, now seen corresponding path program 1 times [2025-02-05 20:15:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:57,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757663746] [2025-02-05 20:15:57,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:57,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 20:15:57,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 20:15:57,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:57,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:57,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:57,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757663746] [2025-02-05 20:15:57,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757663746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:57,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:57,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:15:57,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412321627] [2025-02-05 20:15:57,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:57,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:15:57,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:57,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:15:57,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:15:57,599 INFO L87 Difference]: Start difference. First operand 961 states and 1425 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:58,174 INFO L93 Difference]: Finished difference Result 1876 states and 2782 transitions. [2025-02-05 20:15:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:15:58,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 20:15:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:58,179 INFO L225 Difference]: With dead ends: 1876 [2025-02-05 20:15:58,180 INFO L226 Difference]: Without dead ends: 969 [2025-02-05 20:15:58,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:15:58,181 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 172 mSDsluCounter, 4447 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 5339 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:58,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 5339 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:15:58,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2025-02-05 20:15:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 968. [2025-02-05 20:15:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 1.483971044467425) internal successors, (1435), 967 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1435 transitions. [2025-02-05 20:15:58,200 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1435 transitions. Word has length 149 [2025-02-05 20:15:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:58,200 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1435 transitions. [2025-02-05 20:15:58,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1435 transitions. [2025-02-05 20:15:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 20:15:58,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:58,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:58,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:15:58,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:58,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash -27778006, now seen corresponding path program 1 times [2025-02-05 20:15:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167678987] [2025-02-05 20:15:58,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:58,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 20:15:58,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 20:15:58,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:58,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:58,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167678987] [2025-02-05 20:15:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167678987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:58,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073840977] [2025-02-05 20:15:58,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:58,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:58,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:58,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:58,513 INFO L87 Difference]: Start difference. First operand 968 states and 1435 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:58,866 INFO L93 Difference]: Finished difference Result 1900 states and 2817 transitions. [2025-02-05 20:15:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:58,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 20:15:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:58,869 INFO L225 Difference]: With dead ends: 1900 [2025-02-05 20:15:58,869 INFO L226 Difference]: Without dead ends: 986 [2025-02-05 20:15:58,870 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-02-05 20:15:58,870 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 16 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:58,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:15:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-02-05 20:15:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2025-02-05 20:15:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 1.483248730964467) internal successors, (1461), 985 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1461 transitions. [2025-02-05 20:15:58,884 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1461 transitions. Word has length 149 [2025-02-05 20:15:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:58,884 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1461 transitions. [2025-02-05 20:15:58,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1461 transitions. [2025-02-05 20:15:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 20:15:58,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:58,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:58,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:15:58,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:58,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:58,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1228340457, now seen corresponding path program 1 times [2025-02-05 20:15:58,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:58,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332078798] [2025-02-05 20:15:58,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:58,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 20:15:58,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 20:15:58,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:58,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:59,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:59,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332078798] [2025-02-05 20:15:59,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332078798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:59,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:59,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:59,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971697412] [2025-02-05 20:15:59,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:59,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:59,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:59,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:59,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:59,330 INFO L87 Difference]: Start difference. First operand 986 states and 1461 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 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-02-05 20:15:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:59,669 INFO L93 Difference]: Finished difference Result 1920 states and 2845 transitions. [2025-02-05 20:15:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:59,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 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 150 [2025-02-05 20:15:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:59,674 INFO L225 Difference]: With dead ends: 1920 [2025-02-05 20:15:59,674 INFO L226 Difference]: Without dead ends: 988 [2025-02-05 20:15:59,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:15:59,676 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 1047 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:59,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 2675 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:15:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-02-05 20:15:59,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2025-02-05 20:15:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 1.4822695035460993) internal successors, (1463), 987 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:15:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1463 transitions. [2025-02-05 20:15:59,695 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1463 transitions. Word has length 150 [2025-02-05 20:15:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:59,695 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1463 transitions. [2025-02-05 20:15:59,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 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-02-05 20:15:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1463 transitions. [2025-02-05 20:15:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 20:15:59,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:59,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:15:59,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:15:59,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:59,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 680906248, now seen corresponding path program 1 times [2025-02-05 20:15:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:59,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567483785] [2025-02-05 20:15:59,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:59,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:59,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 20:15:59,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 20:15:59,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:59,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567483785] [2025-02-05 20:16:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567483785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:00,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:00,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752905044] [2025-02-05 20:16:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:00,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:00,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:00,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:00,045 INFO L87 Difference]: Start difference. First operand 988 states and 1463 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:00,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:00,534 INFO L93 Difference]: Finished difference Result 1942 states and 2876 transitions. [2025-02-05 20:16:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-05 20:16:00,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:00,539 INFO L225 Difference]: With dead ends: 1942 [2025-02-05 20:16:00,539 INFO L226 Difference]: Without dead ends: 1008 [2025-02-05 20:16:00,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:00,541 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 3569 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4465 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:00,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4465 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:16:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-02-05 20:16:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2025-02-05 20:16:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 1.480635551142006) internal successors, (1491), 1007 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1491 transitions. [2025-02-05 20:16:00,555 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1491 transitions. Word has length 151 [2025-02-05 20:16:00,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:00,555 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1491 transitions. [2025-02-05 20:16:00,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1491 transitions. [2025-02-05 20:16:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 20:16:00,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:00,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:16:00,557 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:00,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:00,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1717583931, now seen corresponding path program 1 times [2025-02-05 20:16:00,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:00,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165015392] [2025-02-05 20:16:00,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:00,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 20:16:00,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 20:16:00,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:00,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165015392] [2025-02-05 20:16:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165015392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:01,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:01,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:16:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039534480] [2025-02-05 20:16:01,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:01,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:16:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:01,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:16:01,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:01,074 INFO L87 Difference]: Start difference. First operand 1008 states and 1491 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:01,788 INFO L93 Difference]: Finished difference Result 2379 states and 3513 transitions. [2025-02-05 20:16:01,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:01,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-02-05 20:16:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:01,792 INFO L225 Difference]: With dead ends: 2379 [2025-02-05 20:16:01,792 INFO L226 Difference]: Without dead ends: 1425 [2025-02-05 20:16:01,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:16:01,794 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 2133 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2133 SdHoareTripleChecker+Valid, 4412 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:01,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2133 Valid, 4412 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:16:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2025-02-05 20:16:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1012. [2025-02-05 20:16:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.4807121661721068) internal successors, (1497), 1011 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1497 transitions. [2025-02-05 20:16:01,812 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1497 transitions. Word has length 151 [2025-02-05 20:16:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:01,812 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1497 transitions. [2025-02-05 20:16:01,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1497 transitions. [2025-02-05 20:16:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 20:16:01,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:01,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:16:01,814 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:01,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1583687747, now seen corresponding path program 1 times [2025-02-05 20:16:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:01,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312802714] [2025-02-05 20:16:01,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:01,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:01,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 20:16:01,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 20:16:01,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:01,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:02,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:02,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312802714] [2025-02-05 20:16:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312802714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:02,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:02,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221983548] [2025-02-05 20:16:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:02,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:02,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:02,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:02,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:02,126 INFO L87 Difference]: Start difference. First operand 1012 states and 1497 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:02,502 INFO L93 Difference]: Finished difference Result 2026 states and 2996 transitions. [2025-02-05 20:16:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:02,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-02-05 20:16:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:02,506 INFO L225 Difference]: With dead ends: 2026 [2025-02-05 20:16:02,507 INFO L226 Difference]: Without dead ends: 1068 [2025-02-05 20:16:02,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:02,508 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:02,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-02-05 20:16:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2025-02-05 20:16:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1067 states have (on average 1.477975632614808) internal successors, (1577), 1067 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1577 transitions. [2025-02-05 20:16:02,526 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1577 transitions. Word has length 152 [2025-02-05 20:16:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:02,526 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1577 transitions. [2025-02-05 20:16:02,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1577 transitions. [2025-02-05 20:16:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 20:16:02,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:02,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:16:02,529 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:02,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1190253820, now seen corresponding path program 1 times [2025-02-05 20:16:02,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:02,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229818778] [2025-02-05 20:16:02,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:02,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:02,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 20:16:02,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 20:16:02,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:02,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:03,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229818778] [2025-02-05 20:16:03,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229818778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:03,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:03,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:16:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961299664] [2025-02-05 20:16:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:03,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:16:03,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:03,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:16:03,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:16:03,269 INFO L87 Difference]: Start difference. First operand 1068 states and 1577 transitions. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:04,550 INFO L93 Difference]: Finished difference Result 2527 states and 3725 transitions. [2025-02-05 20:16:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:16:04,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-02-05 20:16:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:04,557 INFO L225 Difference]: With dead ends: 2527 [2025-02-05 20:16:04,558 INFO L226 Difference]: Without dead ends: 1513 [2025-02-05 20:16:04,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:16:04,562 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 1630 mSDsluCounter, 7269 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 8560 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:04,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 8560 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 20:16:04,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-02-05 20:16:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1068. [2025-02-05 20:16:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1067 states have (on average 1.477975632614808) internal successors, (1577), 1067 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1577 transitions. [2025-02-05 20:16:04,590 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1577 transitions. Word has length 152 [2025-02-05 20:16:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:04,591 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1577 transitions. [2025-02-05 20:16:04,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1577 transitions. [2025-02-05 20:16:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 20:16:04,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:04,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:04,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:16:04,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:04,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:04,595 INFO L85 PathProgramCache]: Analyzing trace with hash -500397432, now seen corresponding path program 1 times [2025-02-05 20:16:04,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:04,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673566152] [2025-02-05 20:16:04,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:04,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:04,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 20:16:04,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 20:16:04,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:04,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:04,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:04,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673566152] [2025-02-05 20:16:04,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673566152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:04,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:04,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:04,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918569551] [2025-02-05 20:16:04,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:04,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:04,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:04,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:04,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:04,934 INFO L87 Difference]: Start difference. First operand 1068 states and 1577 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:05,389 INFO L93 Difference]: Finished difference Result 2102 states and 3104 transitions. [2025-02-05 20:16:05,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:05,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-05 20:16:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:05,393 INFO L225 Difference]: With dead ends: 2102 [2025-02-05 20:16:05,394 INFO L226 Difference]: Without dead ends: 1088 [2025-02-05 20:16:05,396 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-02-05 20:16:05,397 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:05,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2025-02-05 20:16:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2025-02-05 20:16:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.4765409383624655) internal successors, (1605), 1087 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1605 transitions. [2025-02-05 20:16:05,417 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1605 transitions. Word has length 153 [2025-02-05 20:16:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:05,418 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1605 transitions. [2025-02-05 20:16:05,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1605 transitions. [2025-02-05 20:16:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 20:16:05,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:05,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:16:05,420 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:05,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:05,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1735452605, now seen corresponding path program 1 times [2025-02-05 20:16:05,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:05,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586672995] [2025-02-05 20:16:05,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:05,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:05,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 20:16:05,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 20:16:05,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:05,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586672995] [2025-02-05 20:16:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586672995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:06,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:06,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:16:06,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066739783] [2025-02-05 20:16:06,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:06,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:16:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:06,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:16:06,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:16:06,243 INFO L87 Difference]: Start difference. First operand 1088 states and 1605 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:06,877 INFO L93 Difference]: Finished difference Result 2140 states and 3157 transitions. [2025-02-05 20:16:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:16:06,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-02-05 20:16:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:06,881 INFO L225 Difference]: With dead ends: 2140 [2025-02-05 20:16:06,881 INFO L226 Difference]: Without dead ends: 1106 [2025-02-05 20:16:06,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:16:06,882 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1050 mSDsluCounter, 5328 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 6220 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:06,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 6220 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:16:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-02-05 20:16:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1102. [2025-02-05 20:16:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1101 states have (on average 1.4759309718437783) internal successors, (1625), 1101 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1625 transitions. [2025-02-05 20:16:06,895 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1625 transitions. Word has length 153 [2025-02-05 20:16:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:06,896 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1625 transitions. [2025-02-05 20:16:06,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1625 transitions. [2025-02-05 20:16:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 20:16:06,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:06,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:06,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:16:06,898 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:06,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:06,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1174209774, now seen corresponding path program 1 times [2025-02-05 20:16:06,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:06,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597904937] [2025-02-05 20:16:06,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:06,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:06,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 20:16:06,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 20:16:06,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:06,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:07,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597904937] [2025-02-05 20:16:07,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597904937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:07,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:07,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151878995] [2025-02-05 20:16:07,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:07,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:07,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:07,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:07,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:07,128 INFO L87 Difference]: Start difference. First operand 1102 states and 1625 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:07,442 INFO L93 Difference]: Finished difference Result 2206 states and 3252 transitions. [2025-02-05 20:16:07,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:07,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 20:16:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:07,446 INFO L225 Difference]: With dead ends: 2206 [2025-02-05 20:16:07,446 INFO L226 Difference]: Without dead ends: 1158 [2025-02-05 20:16:07,447 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-02-05 20:16:07,448 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:07,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-05 20:16:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2025-02-05 20:16:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.4736387208297321) internal successors, (1705), 1157 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1705 transitions. [2025-02-05 20:16:07,469 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1705 transitions. Word has length 154 [2025-02-05 20:16:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:07,469 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1705 transitions. [2025-02-05 20:16:07,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1705 transitions. [2025-02-05 20:16:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 20:16:07,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:07,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:07,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 20:16:07,472 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:07,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1037821204, now seen corresponding path program 1 times [2025-02-05 20:16:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:07,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126476792] [2025-02-05 20:16:07,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:07,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 20:16:07,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 20:16:07,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:07,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:07,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:07,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126476792] [2025-02-05 20:16:07,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126476792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:07,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:07,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:16:07,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340164463] [2025-02-05 20:16:07,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:07,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:16:07,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:07,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:16:07,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:07,988 INFO L87 Difference]: Start difference. First operand 1158 states and 1705 transitions. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:08,501 INFO L93 Difference]: Finished difference Result 2269 states and 3341 transitions. [2025-02-05 20:16:08,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:16:08,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2025-02-05 20:16:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:08,504 INFO L225 Difference]: With dead ends: 2269 [2025-02-05 20:16:08,504 INFO L226 Difference]: Without dead ends: 1165 [2025-02-05 20:16:08,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:16:08,506 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 940 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 4412 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:08,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 4412 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:16:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-02-05 20:16:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1164. [2025-02-05 20:16:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.472055030094583) internal successors, (1712), 1163 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1712 transitions. [2025-02-05 20:16:08,523 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1712 transitions. Word has length 154 [2025-02-05 20:16:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:08,525 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1712 transitions. [2025-02-05 20:16:08,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1712 transitions. [2025-02-05 20:16:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 20:16:08,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:08,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:08,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 20:16:08,530 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:08,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:08,530 INFO L85 PathProgramCache]: Analyzing trace with hash -718169432, now seen corresponding path program 1 times [2025-02-05 20:16:08,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479022661] [2025-02-05 20:16:08,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:08,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:08,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 20:16:08,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 20:16:08,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:08,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479022661] [2025-02-05 20:16:08,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479022661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:08,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:08,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289576579] [2025-02-05 20:16:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:08,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:08,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:08,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:08,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:08,814 INFO L87 Difference]: Start difference. First operand 1164 states and 1712 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 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-02-05 20:16:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:09,119 INFO L93 Difference]: Finished difference Result 2294 states and 3374 transitions. [2025-02-05 20:16:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:09,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 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 155 [2025-02-05 20:16:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:09,123 INFO L225 Difference]: With dead ends: 2294 [2025-02-05 20:16:09,123 INFO L226 Difference]: Without dead ends: 1184 [2025-02-05 20:16:09,124 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-02-05 20:16:09,125 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:09,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-02-05 20:16:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1184. [2025-02-05 20:16:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 1.47083685545224) internal successors, (1740), 1183 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1740 transitions. [2025-02-05 20:16:09,141 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1740 transitions. Word has length 155 [2025-02-05 20:16:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:09,141 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1740 transitions. [2025-02-05 20:16:09,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 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-02-05 20:16:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1740 transitions. [2025-02-05 20:16:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 20:16:09,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:09,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:09,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 20:16:09,144 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:09,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash -298917767, now seen corresponding path program 1 times [2025-02-05 20:16:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:09,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472104897] [2025-02-05 20:16:09,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:09,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 20:16:09,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 20:16:09,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:09,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:09,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472104897] [2025-02-05 20:16:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472104897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:09,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:09,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698981551] [2025-02-05 20:16:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:09,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:09,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:09,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:09,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:09,640 INFO L87 Difference]: Start difference. First operand 1184 states and 1740 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 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-02-05 20:16:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:10,017 INFO L93 Difference]: Finished difference Result 2758 states and 4045 transitions. [2025-02-05 20:16:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:10,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 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 155 [2025-02-05 20:16:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:10,021 INFO L225 Difference]: With dead ends: 2758 [2025-02-05 20:16:10,021 INFO L226 Difference]: Without dead ends: 1628 [2025-02-05 20:16:10,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:10,023 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 514 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 3470 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:10,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 3470 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-02-05 20:16:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1186. [2025-02-05 20:16:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1185 states have (on average 1.470042194092827) internal successors, (1742), 1185 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1742 transitions. [2025-02-05 20:16:10,034 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1742 transitions. Word has length 155 [2025-02-05 20:16:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:10,034 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1742 transitions. [2025-02-05 20:16:10,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 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-02-05 20:16:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1742 transitions. [2025-02-05 20:16:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 20:16:10,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:10,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:10,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 20:16:10,036 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:10,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:10,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1324148483, now seen corresponding path program 1 times [2025-02-05 20:16:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:10,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209988755] [2025-02-05 20:16:10,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:10,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:10,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 20:16:10,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 20:16:10,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:10,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:10,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209988755] [2025-02-05 20:16:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209988755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:10,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:10,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941652642] [2025-02-05 20:16:10,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:10,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:10,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:10,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:10,290 INFO L87 Difference]: Start difference. First operand 1186 states and 1742 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:10,590 INFO L93 Difference]: Finished difference Result 2372 states and 3484 transitions. [2025-02-05 20:16:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:10,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-02-05 20:16:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:10,596 INFO L225 Difference]: With dead ends: 2372 [2025-02-05 20:16:10,596 INFO L226 Difference]: Without dead ends: 1242 [2025-02-05 20:16:10,597 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-02-05 20:16:10,598 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:10,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-02-05 20:16:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1242. [2025-02-05 20:16:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 1.468170829975826) internal successors, (1822), 1241 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1822 transitions. [2025-02-05 20:16:10,618 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1822 transitions. Word has length 156 [2025-02-05 20:16:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:10,619 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 1822 transitions. [2025-02-05 20:16:10,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1822 transitions. [2025-02-05 20:16:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 20:16:10,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:10,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:10,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 20:16:10,622 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:10,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:10,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1747261612, now seen corresponding path program 1 times [2025-02-05 20:16:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:10,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897651619] [2025-02-05 20:16:10,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:10,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:10,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 20:16:10,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 20:16:10,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:10,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:10,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:10,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897651619] [2025-02-05 20:16:10,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897651619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:10,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:10,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133222194] [2025-02-05 20:16:10,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:10,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:10,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:10,884 INFO L87 Difference]: Start difference. First operand 1242 states and 1822 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:11,211 INFO L93 Difference]: Finished difference Result 2448 states and 3592 transitions. [2025-02-05 20:16:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:11,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-02-05 20:16:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:11,216 INFO L225 Difference]: With dead ends: 2448 [2025-02-05 20:16:11,217 INFO L226 Difference]: Without dead ends: 1262 [2025-02-05 20:16:11,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:11,219 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 8 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:11,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3574 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2025-02-05 20:16:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1262. [2025-02-05 20:16:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 1.4670896114195082) internal successors, (1850), 1261 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1850 transitions. [2025-02-05 20:16:11,235 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1850 transitions. Word has length 157 [2025-02-05 20:16:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:11,235 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1850 transitions. [2025-02-05 20:16:11,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1850 transitions. [2025-02-05 20:16:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 20:16:11,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:11,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:11,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 20:16:11,237 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:11,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1093316462, now seen corresponding path program 1 times [2025-02-05 20:16:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809072336] [2025-02-05 20:16:11,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:11,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 20:16:11,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 20:16:11,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:11,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:11,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:11,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809072336] [2025-02-05 20:16:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809072336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:11,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:11,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:11,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865786506] [2025-02-05 20:16:11,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:11,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:11,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:11,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:11,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:11,432 INFO L87 Difference]: Start difference. First operand 1262 states and 1850 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:11,723 INFO L93 Difference]: Finished difference Result 2524 states and 3700 transitions. [2025-02-05 20:16:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:11,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-02-05 20:16:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:11,728 INFO L225 Difference]: With dead ends: 2524 [2025-02-05 20:16:11,728 INFO L226 Difference]: Without dead ends: 1318 [2025-02-05 20:16:11,730 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-02-05 20:16:11,731 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 19 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:11,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3574 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-02-05 20:16:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2025-02-05 20:16:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1317 states have (on average 1.4654517843583903) internal successors, (1930), 1317 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1930 transitions. [2025-02-05 20:16:11,747 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1930 transitions. Word has length 158 [2025-02-05 20:16:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:11,747 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1930 transitions. [2025-02-05 20:16:11,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1930 transitions. [2025-02-05 20:16:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 20:16:11,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:11,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:11,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 20:16:11,749 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:11,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2058245448, now seen corresponding path program 1 times [2025-02-05 20:16:11,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:11,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150619561] [2025-02-05 20:16:11,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:11,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 20:16:11,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 20:16:11,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:12,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:12,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150619561] [2025-02-05 20:16:12,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150619561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:12,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:12,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:16:12,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901909790] [2025-02-05 20:16:12,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:12,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:16:12,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:12,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:16:12,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:16:12,572 INFO L87 Difference]: Start difference. First operand 1318 states and 1930 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:13,094 INFO L93 Difference]: Finished difference Result 2612 states and 3826 transitions. [2025-02-05 20:16:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:16:13,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-05 20:16:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:13,100 INFO L225 Difference]: With dead ends: 2612 [2025-02-05 20:16:13,100 INFO L226 Difference]: Without dead ends: 1350 [2025-02-05 20:16:13,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:16:13,104 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 13 mSDsluCounter, 5360 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6258 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:13,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6258 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:16:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-02-05 20:16:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1318. [2025-02-05 20:16:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1317 states have (on average 1.4654517843583903) internal successors, (1930), 1317 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1930 transitions. [2025-02-05 20:16:13,115 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1930 transitions. Word has length 159 [2025-02-05 20:16:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:13,115 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1930 transitions. [2025-02-05 20:16:13,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1930 transitions. [2025-02-05 20:16:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 20:16:13,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:13,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:13,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 20:16:13,117 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:13,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash -393323970, now seen corresponding path program 1 times [2025-02-05 20:16:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130761362] [2025-02-05 20:16:13,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:13,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:13,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 20:16:13,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 20:16:13,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:13,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:13,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:13,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130761362] [2025-02-05 20:16:13,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130761362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:13,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:13,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058699610] [2025-02-05 20:16:13,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:13,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:13,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:13,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:13,537 INFO L87 Difference]: Start difference. First operand 1318 states and 1930 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:13,847 INFO L93 Difference]: Finished difference Result 2590 states and 3794 transitions. [2025-02-05 20:16:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-05 20:16:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:13,850 INFO L225 Difference]: With dead ends: 2590 [2025-02-05 20:16:13,850 INFO L226 Difference]: Without dead ends: 1328 [2025-02-05 20:16:13,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:13,851 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 1 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:13,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4453 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-02-05 20:16:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1328. [2025-02-05 20:16:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1327 states have (on average 1.46345139412208) internal successors, (1942), 1327 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1942 transitions. [2025-02-05 20:16:13,862 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1942 transitions. Word has length 159 [2025-02-05 20:16:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:13,862 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 1942 transitions. [2025-02-05 20:16:13,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1942 transitions. [2025-02-05 20:16:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 20:16:13,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:13,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:13,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 20:16:13,863 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1564813570, now seen corresponding path program 1 times [2025-02-05 20:16:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:13,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877039381] [2025-02-05 20:16:13,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:13,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 20:16:13,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 20:16:13,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:13,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:14,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:14,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877039381] [2025-02-05 20:16:14,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877039381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:14,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:14,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 20:16:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099177231] [2025-02-05 20:16:14,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:14,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 20:16:14,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:14,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 20:16:14,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:16:14,696 INFO L87 Difference]: Start difference. First operand 1328 states and 1942 transitions. Second operand has 23 states, 23 states have (on average 6.956521739130435) internal successors, (160), 23 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-02-05 20:16:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:16,532 INFO L93 Difference]: Finished difference Result 2814 states and 4116 transitions. [2025-02-05 20:16:16,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 20:16:16,536 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.956521739130435) internal successors, (160), 23 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 160 [2025-02-05 20:16:16,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:16,538 INFO L225 Difference]: With dead ends: 2814 [2025-02-05 20:16:16,539 INFO L226 Difference]: Without dead ends: 1542 [2025-02-05 20:16:16,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2025-02-05 20:16:16,540 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 76 mSDsluCounter, 19595 mSDsCounter, 0 mSdLazyCounter, 5094 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 20535 SdHoareTripleChecker+Invalid, 5095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:16,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 20535 Invalid, 5095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5094 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 20:16:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2025-02-05 20:16:16,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1512. [2025-02-05 20:16:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1511 states have (on average 1.4665784248841827) internal successors, (2216), 1511 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2216 transitions. [2025-02-05 20:16:16,554 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2216 transitions. Word has length 160 [2025-02-05 20:16:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:16,554 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2216 transitions. [2025-02-05 20:16:16,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.956521739130435) internal successors, (160), 23 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-02-05 20:16:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2216 transitions. [2025-02-05 20:16:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 20:16:16,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:16,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:16,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 20:16:16,555 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:16,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:16,556 INFO L85 PathProgramCache]: Analyzing trace with hash 208704392, now seen corresponding path program 1 times [2025-02-05 20:16:16,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:16,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892371955] [2025-02-05 20:16:16,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:16,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:16,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 20:16:16,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 20:16:16,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:16,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:17,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:17,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892371955] [2025-02-05 20:16:17,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892371955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:17,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:17,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 20:16:17,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742002586] [2025-02-05 20:16:17,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:17,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 20:16:17,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:17,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 20:16:17,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:16:17,282 INFO L87 Difference]: Start difference. First operand 1512 states and 2216 transitions. Second operand has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 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-02-05 20:16:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:18,515 INFO L93 Difference]: Finished difference Result 3090 states and 4526 transitions. [2025-02-05 20:16:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 20:16:18,516 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 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 160 [2025-02-05 20:16:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:18,518 INFO L225 Difference]: With dead ends: 3090 [2025-02-05 20:16:18,518 INFO L226 Difference]: Without dead ends: 1634 [2025-02-05 20:16:18,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:16:18,520 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 55 mSDsluCounter, 13452 mSDsCounter, 0 mSdLazyCounter, 3337 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 14353 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:18,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 14353 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3337 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 20:16:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-02-05 20:16:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1596. [2025-02-05 20:16:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1595 states have (on average 1.4670846394984327) internal successors, (2340), 1595 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2340 transitions. [2025-02-05 20:16:18,532 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2340 transitions. Word has length 160 [2025-02-05 20:16:18,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:18,532 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2340 transitions. [2025-02-05 20:16:18,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 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-02-05 20:16:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2340 transitions. [2025-02-05 20:16:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 20:16:18,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:18,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:18,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 20:16:18,533 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:18,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:18,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1056481474, now seen corresponding path program 1 times [2025-02-05 20:16:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:18,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660457521] [2025-02-05 20:16:18,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:18,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 20:16:18,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 20:16:18,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:18,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:18,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:18,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660457521] [2025-02-05 20:16:18,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660457521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:18,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:18,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:18,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962455715] [2025-02-05 20:16:18,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:18,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:18,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:18,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:18,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:18,907 INFO L87 Difference]: Start difference. First operand 1596 states and 2340 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 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-02-05 20:16:19,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:19,267 INFO L93 Difference]: Finished difference Result 3156 states and 4628 transitions. [2025-02-05 20:16:19,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:19,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 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 160 [2025-02-05 20:16:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:19,270 INFO L225 Difference]: With dead ends: 3156 [2025-02-05 20:16:19,270 INFO L226 Difference]: Without dead ends: 1616 [2025-02-05 20:16:19,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:19,272 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 1 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:19,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4453 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-02-05 20:16:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1608. [2025-02-05 20:16:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 1.4660858742999379) internal successors, (2356), 1607 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2356 transitions. [2025-02-05 20:16:19,285 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2356 transitions. Word has length 160 [2025-02-05 20:16:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:19,285 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2356 transitions. [2025-02-05 20:16:19,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 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-02-05 20:16:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2356 transitions. [2025-02-05 20:16:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 20:16:19,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:19,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:19,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 20:16:19,286 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:19,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1794752919, now seen corresponding path program 1 times [2025-02-05 20:16:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:19,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129249238] [2025-02-05 20:16:19,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:19,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:19,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 20:16:19,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 20:16:19,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:19,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:19,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:19,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129249238] [2025-02-05 20:16:19,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129249238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:19,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:19,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474863614] [2025-02-05 20:16:19,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:19,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:19,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:19,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:19,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:19,606 INFO L87 Difference]: Start difference. First operand 1608 states and 2356 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:20,036 INFO L93 Difference]: Finished difference Result 3190 states and 4676 transitions. [2025-02-05 20:16:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-02-05 20:16:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:20,039 INFO L225 Difference]: With dead ends: 3190 [2025-02-05 20:16:20,039 INFO L226 Difference]: Without dead ends: 1638 [2025-02-05 20:16:20,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:20,040 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 1 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:20,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4453 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-02-05 20:16:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1626. [2025-02-05 20:16:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 1.4646153846153847) internal successors, (2380), 1625 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2380 transitions. [2025-02-05 20:16:20,055 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2380 transitions. Word has length 161 [2025-02-05 20:16:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:20,055 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2380 transitions. [2025-02-05 20:16:20,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2380 transitions. [2025-02-05 20:16:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:16:20,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:20,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:20,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 20:16:20,057 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:20,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 579038662, now seen corresponding path program 1 times [2025-02-05 20:16:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362981067] [2025-02-05 20:16:20,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:20,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:16:20,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:16:20,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:20,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:20,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:20,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362981067] [2025-02-05 20:16:20,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362981067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:20,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:20,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:16:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849021259] [2025-02-05 20:16:20,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:20,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:16:20,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:20,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:16:20,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:20,568 INFO L87 Difference]: Start difference. First operand 1626 states and 2380 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:20,971 INFO L93 Difference]: Finished difference Result 3264 states and 4774 transitions. [2025-02-05 20:16:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:16:20,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 20:16:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:20,974 INFO L225 Difference]: With dead ends: 3264 [2025-02-05 20:16:20,974 INFO L226 Difference]: Without dead ends: 1694 [2025-02-05 20:16:20,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:16:20,975 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 966 mSDsluCounter, 3532 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:20,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 4419 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-02-05 20:16:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1686. [2025-02-05 20:16:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1685 states have (on average 1.459940652818991) internal successors, (2460), 1685 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2460 transitions. [2025-02-05 20:16:20,989 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2460 transitions. Word has length 162 [2025-02-05 20:16:20,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:20,989 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2460 transitions. [2025-02-05 20:16:20,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2460 transitions. [2025-02-05 20:16:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:16:20,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:20,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:20,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 20:16:20,991 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:20,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1209440959, now seen corresponding path program 1 times [2025-02-05 20:16:20,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:20,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062184771] [2025-02-05 20:16:20,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:20,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:21,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:16:21,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:16:21,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:21,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:21,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:21,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062184771] [2025-02-05 20:16:21,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062184771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:21,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:21,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:21,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840118601] [2025-02-05 20:16:21,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:21,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:21,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:21,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:21,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:21,691 INFO L87 Difference]: Start difference. First operand 1686 states and 2460 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:22,087 INFO L93 Difference]: Finished difference Result 3316 states and 4838 transitions. [2025-02-05 20:16:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:22,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 20:16:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:22,092 INFO L225 Difference]: With dead ends: 3316 [2025-02-05 20:16:22,092 INFO L226 Difference]: Without dead ends: 1686 [2025-02-05 20:16:22,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:22,094 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 7 mSDsluCounter, 3544 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:22,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4433 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2025-02-05 20:16:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1662. [2025-02-05 20:16:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1661 states have (on average 1.4593618302227573) internal successors, (2424), 1661 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2424 transitions. [2025-02-05 20:16:22,111 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2424 transitions. Word has length 162 [2025-02-05 20:16:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:22,112 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2424 transitions. [2025-02-05 20:16:22,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2424 transitions. [2025-02-05 20:16:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:16:22,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:22,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:22,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 20:16:22,113 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:22,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1881690697, now seen corresponding path program 1 times [2025-02-05 20:16:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:22,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003674232] [2025-02-05 20:16:22,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:22,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:22,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:16:22,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:16:22,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:22,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003674232] [2025-02-05 20:16:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003674232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:23,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:23,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-05 20:16:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467404794] [2025-02-05 20:16:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:23,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 20:16:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:23,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 20:16:23,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2025-02-05 20:16:23,278 INFO L87 Difference]: Start difference. First operand 1662 states and 2424 transitions. Second operand has 28 states, 28 states have (on average 5.785714285714286) internal successors, (162), 28 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:25,187 INFO L93 Difference]: Finished difference Result 3780 states and 5510 transitions. [2025-02-05 20:16:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-05 20:16:25,188 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.785714285714286) internal successors, (162), 28 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 20:16:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:25,191 INFO L225 Difference]: With dead ends: 3780 [2025-02-05 20:16:25,191 INFO L226 Difference]: Without dead ends: 2174 [2025-02-05 20:16:25,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2025-02-05 20:16:25,193 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 103 mSDsluCounter, 21205 mSDsCounter, 0 mSdLazyCounter, 5914 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 22055 SdHoareTripleChecker+Invalid, 5932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:25,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 22055 Invalid, 5932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5914 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 20:16:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2025-02-05 20:16:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2110. [2025-02-05 20:16:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 2109 states have (on average 1.4623044096728308) internal successors, (3084), 2109 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 3084 transitions. [2025-02-05 20:16:25,209 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 3084 transitions. Word has length 162 [2025-02-05 20:16:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:25,210 INFO L471 AbstractCegarLoop]: Abstraction has 2110 states and 3084 transitions. [2025-02-05 20:16:25,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.785714285714286) internal successors, (162), 28 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 3084 transitions. [2025-02-05 20:16:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 20:16:25,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:25,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:25,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 20:16:25,212 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:25,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2141695100, now seen corresponding path program 1 times [2025-02-05 20:16:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:25,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579237137] [2025-02-05 20:16:25,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:25,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 20:16:25,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 20:16:25,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:25,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:25,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:25,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579237137] [2025-02-05 20:16:25,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579237137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:25,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:25,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:16:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937114911] [2025-02-05 20:16:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:25,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:16:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:25,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:16:25,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:25,623 INFO L87 Difference]: Start difference. First operand 2110 states and 3084 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:25,980 INFO L93 Difference]: Finished difference Result 4244 states and 6206 transitions. [2025-02-05 20:16:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:16:25,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-05 20:16:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:25,987 INFO L225 Difference]: With dead ends: 4244 [2025-02-05 20:16:25,987 INFO L226 Difference]: Without dead ends: 2190 [2025-02-05 20:16:25,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:16:25,990 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 1039 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:25,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 4415 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2025-02-05 20:16:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2182. [2025-02-05 20:16:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.458963778083448) internal successors, (3182), 2181 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3182 transitions. [2025-02-05 20:16:26,008 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3182 transitions. Word has length 162 [2025-02-05 20:16:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:26,008 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 3182 transitions. [2025-02-05 20:16:26,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3182 transitions. [2025-02-05 20:16:26,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:16:26,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:26,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:26,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 20:16:26,011 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1644219088, now seen corresponding path program 1 times [2025-02-05 20:16:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:26,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29905380] [2025-02-05 20:16:26,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:26,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:16:26,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:16:26,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:26,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29905380] [2025-02-05 20:16:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29905380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:26,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 20:16:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000123510] [2025-02-05 20:16:26,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:26,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 20:16:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:26,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 20:16:26,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:16:26,711 INFO L87 Difference]: Start difference. First operand 2182 states and 3182 transitions. Second operand has 14 states, 14 states have (on average 11.642857142857142) internal successors, (163), 14 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:27,526 INFO L93 Difference]: Finished difference Result 4412 states and 6434 transitions. [2025-02-05 20:16:27,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 20:16:27,527 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.642857142857142) internal successors, (163), 14 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-05 20:16:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:27,530 INFO L225 Difference]: With dead ends: 4412 [2025-02-05 20:16:27,530 INFO L226 Difference]: Without dead ends: 2286 [2025-02-05 20:16:27,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:16:27,531 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 45 mSDsluCounter, 9624 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 10499 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:27,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 10499 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:16:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2025-02-05 20:16:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2126. [2025-02-05 20:16:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 2125 states have (on average 1.4597647058823529) internal successors, (3102), 2125 states have internal predecessors, (3102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 3102 transitions. [2025-02-05 20:16:27,547 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 3102 transitions. Word has length 163 [2025-02-05 20:16:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:27,547 INFO L471 AbstractCegarLoop]: Abstraction has 2126 states and 3102 transitions. [2025-02-05 20:16:27,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.642857142857142) internal successors, (163), 14 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 3102 transitions. [2025-02-05 20:16:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 20:16:27,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:27,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:27,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 20:16:27,548 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:27,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2012091546, now seen corresponding path program 1 times [2025-02-05 20:16:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:27,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56355940] [2025-02-05 20:16:27,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:27,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 20:16:27,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 20:16:27,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:27,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56355940] [2025-02-05 20:16:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56355940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:28,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:28,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307236512] [2025-02-05 20:16:28,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:28,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:28,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:28,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:28,056 INFO L87 Difference]: Start difference. First operand 2126 states and 3102 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:28,431 INFO L93 Difference]: Finished difference Result 4196 states and 6122 transitions. [2025-02-05 20:16:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:28,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-05 20:16:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:28,436 INFO L225 Difference]: With dead ends: 4196 [2025-02-05 20:16:28,436 INFO L226 Difference]: Without dead ends: 2126 [2025-02-05 20:16:28,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:28,439 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 7 mSDsluCounter, 3540 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:28,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4428 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2025-02-05 20:16:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2090. [2025-02-05 20:16:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2089 states have (on average 1.4571565342269028) internal successors, (3044), 2089 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 3044 transitions. [2025-02-05 20:16:28,459 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 3044 transitions. Word has length 163 [2025-02-05 20:16:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:28,460 INFO L471 AbstractCegarLoop]: Abstraction has 2090 states and 3044 transitions. [2025-02-05 20:16:28,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3044 transitions. [2025-02-05 20:16:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 20:16:28,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:28,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:28,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 20:16:28,462 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:28,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:28,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1555251768, now seen corresponding path program 1 times [2025-02-05 20:16:28,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:28,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683222377] [2025-02-05 20:16:28,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:28,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 20:16:28,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 20:16:28,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:28,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683222377] [2025-02-05 20:16:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683222377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:16:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232543643] [2025-02-05 20:16:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:28,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:16:28,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:28,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:16:28,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:16:28,949 INFO L87 Difference]: Start difference. First operand 2090 states and 3044 transitions. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:29,745 INFO L93 Difference]: Finished difference Result 4304 states and 6274 transitions. [2025-02-05 20:16:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:16:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-05 20:16:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:29,748 INFO L225 Difference]: With dead ends: 4304 [2025-02-05 20:16:29,748 INFO L226 Difference]: Without dead ends: 2270 [2025-02-05 20:16:29,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:16:29,750 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 36 mSDsluCounter, 8203 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 9122 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:29,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 9122 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:16:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2025-02-05 20:16:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 1878. [2025-02-05 20:16:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1877 states have (on average 1.4533830580713905) internal successors, (2728), 1877 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2728 transitions. [2025-02-05 20:16:29,766 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2728 transitions. Word has length 164 [2025-02-05 20:16:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:29,766 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 2728 transitions. [2025-02-05 20:16:29,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2728 transitions. [2025-02-05 20:16:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 20:16:29,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:29,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:29,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 20:16:29,767 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:29,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash -80784876, now seen corresponding path program 1 times [2025-02-05 20:16:29,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:29,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832243166] [2025-02-05 20:16:29,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:29,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:29,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 20:16:29,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 20:16:29,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:29,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:30,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:30,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832243166] [2025-02-05 20:16:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832243166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:30,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:30,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 20:16:30,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917106081] [2025-02-05 20:16:30,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:30,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 20:16:30,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:30,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 20:16:30,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:16:30,605 INFO L87 Difference]: Start difference. First operand 1878 states and 2728 transitions. Second operand has 23 states, 23 states have (on average 7.130434782608695) internal successors, (164), 23 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:32,338 INFO L93 Difference]: Finished difference Result 4114 states and 5974 transitions. [2025-02-05 20:16:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 20:16:32,339 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.130434782608695) internal successors, (164), 23 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-05 20:16:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:32,341 INFO L225 Difference]: With dead ends: 4114 [2025-02-05 20:16:32,341 INFO L226 Difference]: Without dead ends: 2292 [2025-02-05 20:16:32,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:16:32,342 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 63 mSDsluCounter, 19590 mSDsCounter, 0 mSdLazyCounter, 5272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 20530 SdHoareTripleChecker+Invalid, 5272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:32,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 20530 Invalid, 5272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5272 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 20:16:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2025-02-05 20:16:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2226. [2025-02-05 20:16:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 2225 states have (on average 1.4597752808988764) internal successors, (3248), 2225 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 3248 transitions. [2025-02-05 20:16:32,367 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 3248 transitions. Word has length 164 [2025-02-05 20:16:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:32,367 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 3248 transitions. [2025-02-05 20:16:32,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.130434782608695) internal successors, (164), 23 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:32,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 3248 transitions. [2025-02-05 20:16:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 20:16:32,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:32,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:32,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 20:16:32,369 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:32,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:32,370 INFO L85 PathProgramCache]: Analyzing trace with hash 796547288, now seen corresponding path program 1 times [2025-02-05 20:16:32,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:32,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667637544] [2025-02-05 20:16:32,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:32,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:32,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 20:16:32,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 20:16:32,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:32,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:32,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667637544] [2025-02-05 20:16:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667637544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:32,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:32,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595887577] [2025-02-05 20:16:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:32,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:32,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:32,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:32,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:32,710 INFO L87 Difference]: Start difference. First operand 2226 states and 3248 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:33,360 INFO L93 Difference]: Finished difference Result 5414 states and 7893 transitions. [2025-02-05 20:16:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-05 20:16:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:33,363 INFO L225 Difference]: With dead ends: 5414 [2025-02-05 20:16:33,363 INFO L226 Difference]: Without dead ends: 3244 [2025-02-05 20:16:33,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:33,366 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 2114 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:33,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 2029 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:16:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2025-02-05 20:16:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 2278. [2025-02-05 20:16:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2277 states have (on average 1.458937198067633) internal successors, (3322), 2277 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 3322 transitions. [2025-02-05 20:16:33,391 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 3322 transitions. Word has length 164 [2025-02-05 20:16:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:33,391 INFO L471 AbstractCegarLoop]: Abstraction has 2278 states and 3322 transitions. [2025-02-05 20:16:33,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 3322 transitions. [2025-02-05 20:16:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:16:33,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:33,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:33,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 20:16:33,393 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:33,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash 120108434, now seen corresponding path program 1 times [2025-02-05 20:16:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:33,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503085893] [2025-02-05 20:16:33,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:33,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:16:33,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:16:33,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:33,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:34,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:34,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503085893] [2025-02-05 20:16:34,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503085893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:34,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:34,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:16:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658239292] [2025-02-05 20:16:34,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:34,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:16:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:34,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:16:34,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:16:34,135 INFO L87 Difference]: Start difference. First operand 2278 states and 3322 transitions. Second operand has 12 states, 12 states have (on average 13.75) internal successors, (165), 12 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-02-05 20:16:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:34,868 INFO L93 Difference]: Finished difference Result 4306 states and 6270 transitions. [2025-02-05 20:16:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:16:34,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 12 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 165 [2025-02-05 20:16:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:34,871 INFO L225 Difference]: With dead ends: 4306 [2025-02-05 20:16:34,871 INFO L226 Difference]: Without dead ends: 2136 [2025-02-05 20:16:34,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:16:34,874 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 11 mSDsluCounter, 7890 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8769 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:34,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8769 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1980 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:16:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2025-02-05 20:16:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2122. [2025-02-05 20:16:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2121 states have (on average 1.455917020273456) internal successors, (3088), 2121 states have internal predecessors, (3088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3088 transitions. [2025-02-05 20:16:34,893 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3088 transitions. Word has length 165 [2025-02-05 20:16:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:34,893 INFO L471 AbstractCegarLoop]: Abstraction has 2122 states and 3088 transitions. [2025-02-05 20:16:34,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 12 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-02-05 20:16:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3088 transitions. [2025-02-05 20:16:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:16:34,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:34,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:34,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 20:16:34,895 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:34,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2123866692, now seen corresponding path program 1 times [2025-02-05 20:16:34,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:34,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664522071] [2025-02-05 20:16:34,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:34,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:34,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:16:35,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:16:35,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:35,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664522071] [2025-02-05 20:16:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664522071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:35,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 20:16:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012125954] [2025-02-05 20:16:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:35,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 20:16:35,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:35,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 20:16:35,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:16:35,901 INFO L87 Difference]: Start difference. First operand 2122 states and 3088 transitions. Second operand has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 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-02-05 20:16:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:36,916 INFO L93 Difference]: Finished difference Result 4192 states and 6094 transitions. [2025-02-05 20:16:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:16:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 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 165 [2025-02-05 20:16:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:36,919 INFO L225 Difference]: With dead ends: 4192 [2025-02-05 20:16:36,919 INFO L226 Difference]: Without dead ends: 2178 [2025-02-05 20:16:36,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:16:36,921 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 10 mSDsluCounter, 9631 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 10509 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:36,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 10509 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:16:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2025-02-05 20:16:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2156. [2025-02-05 20:16:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2155 states have (on average 1.454292343387471) internal successors, (3134), 2155 states have internal predecessors, (3134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3134 transitions. [2025-02-05 20:16:36,956 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3134 transitions. Word has length 165 [2025-02-05 20:16:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:36,956 INFO L471 AbstractCegarLoop]: Abstraction has 2156 states and 3134 transitions. [2025-02-05 20:16:36,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 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-02-05 20:16:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3134 transitions. [2025-02-05 20:16:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:16:36,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:36,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:36,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 20:16:36,962 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:36,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:36,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2025589150, now seen corresponding path program 1 times [2025-02-05 20:16:36,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:36,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692765364] [2025-02-05 20:16:36,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:36,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:37,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:16:37,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:16:37,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:37,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:37,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:37,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692765364] [2025-02-05 20:16:37,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692765364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:37,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:37,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:37,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658699776] [2025-02-05 20:16:37,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:37,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:37,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:37,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:37,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:37,483 INFO L87 Difference]: Start difference. First operand 2156 states and 3134 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-02-05 20:16:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:37,878 INFO L93 Difference]: Finished difference Result 4236 states and 6162 transitions. [2025-02-05 20:16:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:37,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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 165 [2025-02-05 20:16:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:37,880 INFO L225 Difference]: With dead ends: 4236 [2025-02-05 20:16:37,881 INFO L226 Difference]: Without dead ends: 2188 [2025-02-05 20:16:37,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:37,883 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 1 mSDsluCounter, 3552 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4443 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:37,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4443 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2025-02-05 20:16:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 2032. [2025-02-05 20:16:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2031 states have (on average 1.4524864598719842) internal successors, (2950), 2031 states have internal predecessors, (2950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2950 transitions. [2025-02-05 20:16:37,906 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2950 transitions. Word has length 165 [2025-02-05 20:16:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:37,906 INFO L471 AbstractCegarLoop]: Abstraction has 2032 states and 2950 transitions. [2025-02-05 20:16:37,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 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-02-05 20:16:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2950 transitions. [2025-02-05 20:16:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:16:37,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:37,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:37,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 20:16:37,908 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:37,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1271093767, now seen corresponding path program 1 times [2025-02-05 20:16:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:37,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606618068] [2025-02-05 20:16:37,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:37,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:16:38,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:16:38,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:38,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:38,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:38,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606618068] [2025-02-05 20:16:38,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606618068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:38,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:16:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723706366] [2025-02-05 20:16:38,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:38,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:16:38,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:38,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:16:38,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:38,393 INFO L87 Difference]: Start difference. First operand 2032 states and 2950 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 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-02-05 20:16:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:38,749 INFO L93 Difference]: Finished difference Result 4088 states and 5934 transitions. [2025-02-05 20:16:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:16:38,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 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 165 [2025-02-05 20:16:38,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:38,752 INFO L225 Difference]: With dead ends: 4088 [2025-02-05 20:16:38,752 INFO L226 Difference]: Without dead ends: 2164 [2025-02-05 20:16:38,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:16:38,754 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 998 mSDsluCounter, 3524 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 4409 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:38,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 4409 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2025-02-05 20:16:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2152. [2025-02-05 20:16:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2151 states have (on average 1.4476987447698744) internal successors, (3114), 2151 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 3114 transitions. [2025-02-05 20:16:38,770 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 3114 transitions. Word has length 165 [2025-02-05 20:16:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:38,770 INFO L471 AbstractCegarLoop]: Abstraction has 2152 states and 3114 transitions. [2025-02-05 20:16:38,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 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-02-05 20:16:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 3114 transitions. [2025-02-05 20:16:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:16:38,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:38,772 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:38,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 20:16:38,772 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:38,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash 556089160, now seen corresponding path program 1 times [2025-02-05 20:16:38,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:38,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815318690] [2025-02-05 20:16:38,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:38,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:16:38,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:16:38,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:38,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:39,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815318690] [2025-02-05 20:16:39,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815318690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:39,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:39,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-05 20:16:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879218080] [2025-02-05 20:16:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:39,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 20:16:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:39,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 20:16:39,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2025-02-05 20:16:39,797 INFO L87 Difference]: Start difference. First operand 2152 states and 3114 transitions. Second operand has 22 states, 22 states have (on average 7.5) internal successors, (165), 22 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-02-05 20:16:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:41,414 INFO L93 Difference]: Finished difference Result 4670 states and 6754 transitions. [2025-02-05 20:16:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:16:41,415 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 22 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 165 [2025-02-05 20:16:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:41,417 INFO L225 Difference]: With dead ends: 4670 [2025-02-05 20:16:41,417 INFO L226 Difference]: Without dead ends: 2626 [2025-02-05 20:16:41,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2025-02-05 20:16:41,419 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 66 mSDsluCounter, 16274 mSDsCounter, 0 mSdLazyCounter, 4355 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 17132 SdHoareTripleChecker+Invalid, 4368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:41,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 17132 Invalid, 4368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4355 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 20:16:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2025-02-05 20:16:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2414. [2025-02-05 20:16:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2413 states have (on average 1.449647741400746) internal successors, (3498), 2413 states have internal predecessors, (3498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3498 transitions. [2025-02-05 20:16:41,439 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3498 transitions. Word has length 165 [2025-02-05 20:16:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:41,439 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 3498 transitions. [2025-02-05 20:16:41,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 22 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-02-05 20:16:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3498 transitions. [2025-02-05 20:16:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 20:16:41,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:41,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:41,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-05 20:16:41,440 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:41,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1718856804, now seen corresponding path program 1 times [2025-02-05 20:16:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:41,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632789361] [2025-02-05 20:16:41,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:41,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:41,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 20:16:41,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 20:16:41,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:41,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:42,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632789361] [2025-02-05 20:16:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632789361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:42,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:42,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:16:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893255091] [2025-02-05 20:16:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:42,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:16:42,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:42,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:16:42,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:16:42,144 INFO L87 Difference]: Start difference. First operand 2414 states and 3498 transitions. Second operand has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 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-02-05 20:16:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:42,825 INFO L93 Difference]: Finished difference Result 4720 states and 6840 transitions. [2025-02-05 20:16:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:16:42,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 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 165 [2025-02-05 20:16:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:42,828 INFO L225 Difference]: With dead ends: 4720 [2025-02-05 20:16:42,828 INFO L226 Difference]: Without dead ends: 2414 [2025-02-05 20:16:42,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:16:42,830 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 11 mSDsluCounter, 7936 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8822 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:42,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8822 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:16:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2025-02-05 20:16:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2414. [2025-02-05 20:16:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2413 states have (on average 1.4471612101118938) internal successors, (3492), 2413 states have internal predecessors, (3492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 3492 transitions. [2025-02-05 20:16:42,844 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 3492 transitions. Word has length 165 [2025-02-05 20:16:42,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:42,844 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 3492 transitions. [2025-02-05 20:16:42,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 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-02-05 20:16:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 3492 transitions. [2025-02-05 20:16:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 20:16:42,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:42,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:42,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-05 20:16:42,845 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:42,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:42,846 INFO L85 PathProgramCache]: Analyzing trace with hash -675011815, now seen corresponding path program 1 times [2025-02-05 20:16:42,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:42,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908026589] [2025-02-05 20:16:42,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:42,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:42,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 20:16:42,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 20:16:42,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:42,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:44,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:44,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908026589] [2025-02-05 20:16:44,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908026589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:44,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:44,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-02-05 20:16:44,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310807136] [2025-02-05 20:16:44,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:44,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 20:16:44,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:44,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 20:16:44,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2025-02-05 20:16:44,591 INFO L87 Difference]: Start difference. First operand 2414 states and 3492 transitions. Second operand has 25 states, 25 states have (on average 6.64) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:46,724 INFO L93 Difference]: Finished difference Result 4936 states and 7138 transitions. [2025-02-05 20:16:46,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 20:16:46,725 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.64) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-02-05 20:16:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:46,728 INFO L225 Difference]: With dead ends: 4936 [2025-02-05 20:16:46,728 INFO L226 Difference]: Without dead ends: 2630 [2025-02-05 20:16:46,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2025-02-05 20:16:46,730 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 65 mSDsluCounter, 19591 mSDsCounter, 0 mSdLazyCounter, 5261 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 20446 SdHoareTripleChecker+Invalid, 5275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 5261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:46,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 20446 Invalid, 5275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 5261 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 20:16:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2025-02-05 20:16:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2454. [2025-02-05 20:16:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2453 states have (on average 1.4488381573583367) internal successors, (3554), 2453 states have internal predecessors, (3554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 3554 transitions. [2025-02-05 20:16:46,750 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 3554 transitions. Word has length 166 [2025-02-05 20:16:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:46,750 INFO L471 AbstractCegarLoop]: Abstraction has 2454 states and 3554 transitions. [2025-02-05 20:16:46,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.64) internal successors, (166), 25 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 3554 transitions. [2025-02-05 20:16:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 20:16:46,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:46,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:46,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 20:16:46,752 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:46,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash -972680457, now seen corresponding path program 1 times [2025-02-05 20:16:46,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:46,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616939925] [2025-02-05 20:16:46,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:46,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 20:16:46,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 20:16:46,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:46,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:47,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:47,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616939925] [2025-02-05 20:16:47,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616939925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:47,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:47,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:16:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340574585] [2025-02-05 20:16:47,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:47,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:16:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:47,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:16:47,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:47,110 INFO L87 Difference]: Start difference. First operand 2454 states and 3554 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:47,487 INFO L93 Difference]: Finished difference Result 4820 states and 6982 transitions. [2025-02-05 20:16:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-02-05 20:16:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:47,489 INFO L225 Difference]: With dead ends: 4820 [2025-02-05 20:16:47,489 INFO L226 Difference]: Without dead ends: 2474 [2025-02-05 20:16:47,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:47,491 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 1 mSDsluCounter, 4433 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5323 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:47,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5323 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2025-02-05 20:16:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2466. [2025-02-05 20:16:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2465 states have (on average 1.4482758620689655) internal successors, (3570), 2465 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3570 transitions. [2025-02-05 20:16:47,506 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3570 transitions. Word has length 166 [2025-02-05 20:16:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:47,507 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3570 transitions. [2025-02-05 20:16:47,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3570 transitions. [2025-02-05 20:16:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 20:16:47,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:47,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:47,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 20:16:47,508 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:47,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1841102216, now seen corresponding path program 1 times [2025-02-05 20:16:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896782084] [2025-02-05 20:16:47,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:47,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 20:16:47,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 20:16:47,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:47,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:48,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:48,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896782084] [2025-02-05 20:16:48,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896782084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:48,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 20:16:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774749068] [2025-02-05 20:16:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:48,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 20:16:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:48,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 20:16:48,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:16:48,874 INFO L87 Difference]: Start difference. First operand 2466 states and 3570 transitions. Second operand has 23 states, 23 states have (on average 7.260869565217392) internal successors, (167), 23 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:50,682 INFO L93 Difference]: Finished difference Result 5128 states and 7428 transitions. [2025-02-05 20:16:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 20:16:50,683 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.260869565217392) internal successors, (167), 23 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 20:16:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:50,686 INFO L225 Difference]: With dead ends: 5128 [2025-02-05 20:16:50,687 INFO L226 Difference]: Without dead ends: 2770 [2025-02-05 20:16:50,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2025-02-05 20:16:50,690 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 40 mSDsluCounter, 16392 mSDsCounter, 0 mSdLazyCounter, 4433 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 17260 SdHoareTripleChecker+Invalid, 4443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:50,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 17260 Invalid, 4443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 4433 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 20:16:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2025-02-05 20:16:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2558. [2025-02-05 20:16:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2557 states have (on average 1.455612045365663) internal successors, (3722), 2557 states have internal predecessors, (3722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3722 transitions. [2025-02-05 20:16:50,720 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3722 transitions. Word has length 167 [2025-02-05 20:16:50,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:50,720 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3722 transitions. [2025-02-05 20:16:50,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.260869565217392) internal successors, (167), 23 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:50,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3722 transitions. [2025-02-05 20:16:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 20:16:50,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:50,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:50,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-05 20:16:50,723 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:50,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:50,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2078488338, now seen corresponding path program 1 times [2025-02-05 20:16:50,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:50,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858335416] [2025-02-05 20:16:50,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:50,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:50,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 20:16:50,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 20:16:50,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:50,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:51,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858335416] [2025-02-05 20:16:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858335416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:51,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:16:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210630906] [2025-02-05 20:16:51,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:51,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:16:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:51,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:16:51,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:51,441 INFO L87 Difference]: Start difference. First operand 2558 states and 3722 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:51,904 INFO L93 Difference]: Finished difference Result 5008 states and 7288 transitions. [2025-02-05 20:16:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:16:51,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 20:16:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:51,907 INFO L225 Difference]: With dead ends: 5008 [2025-02-05 20:16:51,907 INFO L226 Difference]: Without dead ends: 2558 [2025-02-05 20:16:51,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:51,909 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 11 mSDsluCounter, 4407 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5292 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:51,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 5292 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-02-05 20:16:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2542. [2025-02-05 20:16:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 2541 states have (on average 1.4482487209759938) internal successors, (3680), 2541 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3680 transitions. [2025-02-05 20:16:51,926 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3680 transitions. Word has length 167 [2025-02-05 20:16:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:51,927 INFO L471 AbstractCegarLoop]: Abstraction has 2542 states and 3680 transitions. [2025-02-05 20:16:51,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3680 transitions. [2025-02-05 20:16:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 20:16:51,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:51,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:51,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-05 20:16:51,928 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:51,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash 69946226, now seen corresponding path program 1 times [2025-02-05 20:16:51,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:51,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768858435] [2025-02-05 20:16:51,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:51,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:51,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 20:16:52,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 20:16:52,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:52,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:52,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:52,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768858435] [2025-02-05 20:16:52,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768858435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:52,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:52,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:16:52,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281917508] [2025-02-05 20:16:52,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:52,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:16:52,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:52,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:16:52,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:52,309 INFO L87 Difference]: Start difference. First operand 2542 states and 3680 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:52,692 INFO L93 Difference]: Finished difference Result 5866 states and 8480 transitions. [2025-02-05 20:16:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:16:52,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-05 20:16:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:52,695 INFO L225 Difference]: With dead ends: 5866 [2025-02-05 20:16:52,695 INFO L226 Difference]: Without dead ends: 3429 [2025-02-05 20:16:52,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:52,697 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 2093 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:52,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 2630 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2025-02-05 20:16:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 2537. [2025-02-05 20:16:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 2536 states have (on average 1.4479495268138802) internal successors, (3672), 2536 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 3672 transitions. [2025-02-05 20:16:52,714 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 3672 transitions. Word has length 167 [2025-02-05 20:16:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:52,714 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 3672 transitions. [2025-02-05 20:16:52,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3672 transitions. [2025-02-05 20:16:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 20:16:52,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:52,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:52,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-05 20:16:52,715 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:52,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:52,716 INFO L85 PathProgramCache]: Analyzing trace with hash 117275995, now seen corresponding path program 1 times [2025-02-05 20:16:52,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:52,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396315452] [2025-02-05 20:16:52,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:52,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:52,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 20:16:52,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 20:16:52,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:52,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:53,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:53,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396315452] [2025-02-05 20:16:53,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396315452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:53,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:53,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 20:16:53,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958471166] [2025-02-05 20:16:53,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:53,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 20:16:53,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:53,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 20:16:53,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:16:53,746 INFO L87 Difference]: Start difference. First operand 2537 states and 3672 transitions. Second operand has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:54,606 INFO L93 Difference]: Finished difference Result 5027 states and 7268 transitions. [2025-02-05 20:16:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 20:16:54,606 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-02-05 20:16:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:54,609 INFO L225 Difference]: With dead ends: 5027 [2025-02-05 20:16:54,609 INFO L226 Difference]: Without dead ends: 2593 [2025-02-05 20:16:54,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:16:54,611 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 42 mSDsluCounter, 9581 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 10452 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:54,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 10452 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:16:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2025-02-05 20:16:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2505. [2025-02-05 20:16:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2504 states have (on average 1.4456869009584665) internal successors, (3620), 2504 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3620 transitions. [2025-02-05 20:16:54,628 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3620 transitions. Word has length 168 [2025-02-05 20:16:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:54,628 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 3620 transitions. [2025-02-05 20:16:54,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3620 transitions. [2025-02-05 20:16:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 20:16:54,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:54,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:54,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-05 20:16:54,629 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:54,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash 369641052, now seen corresponding path program 1 times [2025-02-05 20:16:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507354987] [2025-02-05 20:16:54,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:54,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 20:16:54,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 20:16:54,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:54,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat