./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8026e8fad442d359c5ad25f6b8e6c64a8eb4f5fda678822051ba0bded2a5b47e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:30:49,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:30:49,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:30:49,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:30:49,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:30:49,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:30:49,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:30:49,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:30:49,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:30:49,375 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:30:49,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:30:49,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:30:49,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:30:49,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:30:49,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:30:49,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:30:49,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:30:49,377 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8026e8fad442d359c5ad25f6b8e6c64a8eb4f5fda678822051ba0bded2a5b47e [2025-03-03 18:30:49,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:30:49,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:30:49,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:30:49,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:30:49,610 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:30:49,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c [2025-03-03 18:30:50,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6113f5206/110f9349581f4ab8867810742ac76eb8/FLAG916952557 [2025-03-03 18:30:51,073 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:30:51,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c [2025-03-03 18:30:51,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6113f5206/110f9349581f4ab8867810742ac76eb8/FLAG916952557 [2025-03-03 18:30:51,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6113f5206/110f9349581f4ab8867810742ac76eb8 [2025-03-03 18:30:51,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:30:51,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:30:51,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:30:51,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:30:51,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:30:51,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:51,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d57fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51, skipping insertion in model container [2025-03-03 18:30:51,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:51,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:30:51,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c[1257,1270] [2025-03-03 18:30:51,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:30:51,719 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:30:51,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c[1257,1270] [2025-03-03 18:30:51,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:30:51,878 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:30:51,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51 WrapperNode [2025-03-03 18:30:51,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:30:51,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:30:51,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:30:51,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:30:51,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:51,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,211 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3696 [2025-03-03 18:30:52,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:30:52,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:30:52,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:30:52,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:30:52,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,370 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:30:52,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:30:52,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:30:52,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:30:52,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:30:52,594 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (1/1) ... [2025-03-03 18:30:52,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:30:52,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:30:52,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:30:52,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:30:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:30:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:30:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:30:52,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:30:52,954 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:30:52,955 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:30:55,474 INFO L? ?]: Removed 2341 outVars from TransFormulas that were not future-live. [2025-03-03 18:30:55,474 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:30:55,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:30:55,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:30:55,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:30:55 BoogieIcfgContainer [2025-03-03 18:30:55,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:30:55,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:30:55,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:30:55,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:30:55,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:30:51" (1/3) ... [2025-03-03 18:30:55,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a009a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:30:55, skipping insertion in model container [2025-03-03 18:30:55,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:30:51" (2/3) ... [2025-03-03 18:30:55,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a009a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:30:55, skipping insertion in model container [2025-03-03 18:30:55,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:30:55" (3/3) ... [2025-03-03 18:30:55,675 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_two_p2.c [2025-03-03 18:30:55,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:30:55,704 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_two_p2.c that has 1 procedures, 1041 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:30:55,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:30:55,823 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;@450f32f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:30:55,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:30:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 1041 states, 1039 states have (on average 1.5024061597690086) internal successors, (1561), 1040 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 18:30:55,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:55,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] [2025-03-03 18:30:55,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:55,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1949905368, now seen corresponding path program 1 times [2025-03-03 18:30:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:55,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380492074] [2025-03-03 18:30:55,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:56,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 18:30:56,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 18:30:56,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:57,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:57,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380492074] [2025-03-03 18:30:57,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380492074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:57,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:57,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:30:57,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240753736] [2025-03-03 18:30:57,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:57,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:30:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:57,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:30:57,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:57,544 INFO L87 Difference]: Start difference. First operand has 1041 states, 1039 states have (on average 1.5024061597690086) internal successors, (1561), 1040 states have internal predecessors, (1561), 0 states have call successors, (0), 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 38.75) internal successors, (155), 4 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-03-03 18:30:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:58,092 INFO L93 Difference]: Finished difference Result 2039 states and 3061 transitions. [2025-03-03 18:30:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:30:58,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 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-03-03 18:30:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:58,104 INFO L225 Difference]: With dead ends: 2039 [2025-03-03 18:30:58,108 INFO L226 Difference]: Without dead ends: 1040 [2025-03-03 18:30:58,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:58,115 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 0 mSDsluCounter, 2593 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3892 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:58,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3892 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:30:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-03-03 18:30:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1040. [2025-03-03 18:30:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 1039 states have (on average 1.5004812319538017) internal successors, (1559), 1039 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1559 transitions. [2025-03-03 18:30:58,199 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1559 transitions. Word has length 155 [2025-03-03 18:30:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:58,199 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1559 transitions. [2025-03-03 18:30:58,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 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-03-03 18:30:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1559 transitions. [2025-03-03 18:30:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 18:30:58,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30: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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:30:58,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:30:58,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:58,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:58,205 INFO L85 PathProgramCache]: Analyzing trace with hash 322204676, now seen corresponding path program 1 times [2025-03-03 18:30:58,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106697319] [2025-03-03 18:30:58,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:58,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 18:30:58,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 18:30:58,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:30:58,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:30:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:30:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:30:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106697319] [2025-03-03 18:30:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106697319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:30:59,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:30:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:30:59,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513664919] [2025-03-03 18:30:59,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:30:59,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:30:59,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:30:59,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:30:59,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:59,008 INFO L87 Difference]: Start difference. First operand 1040 states and 1559 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 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-03-03 18:30:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:30:59,407 INFO L93 Difference]: Finished difference Result 2040 states and 3059 transitions. [2025-03-03 18:30:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:30:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 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-03-03 18:30:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:30:59,411 INFO L225 Difference]: With dead ends: 2040 [2025-03-03 18:30:59,411 INFO L226 Difference]: Without dead ends: 1042 [2025-03-03 18:30:59,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:30:59,413 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 0 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3889 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:30:59,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3889 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:30:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-03-03 18:30:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2025-03-03 18:30:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 1.4995196926032661) internal successors, (1561), 1041 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:30:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1561 transitions. [2025-03-03 18:30:59,435 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1561 transitions. Word has length 156 [2025-03-03 18:30:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:30:59,436 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1561 transitions. [2025-03-03 18:30:59,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 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-03-03 18:30:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1561 transitions. [2025-03-03 18:30:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 18:30:59,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:30:59,439 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-03-03 18:30:59,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:30:59,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:30:59,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:30:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash -965046445, now seen corresponding path program 1 times [2025-03-03 18:30:59,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:30:59,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507225121] [2025-03-03 18:30:59,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:30:59,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:30:59,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 18:31:02,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 18:31:02,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:02,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507225121] [2025-03-03 18:31:04,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507225121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:04,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:04,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:04,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950355227] [2025-03-03 18:31:04,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:04,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:04,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:04,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:04,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:04,176 INFO L87 Difference]: Start difference. First operand 1042 states and 1561 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 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-03-03 18:31:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:05,241 INFO L93 Difference]: Finished difference Result 2722 states and 4079 transitions. [2025-03-03 18:31:05,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:05,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 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-03-03 18:31:05,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:05,247 INFO L225 Difference]: With dead ends: 2722 [2025-03-03 18:31:05,248 INFO L226 Difference]: Without dead ends: 1722 [2025-03-03 18:31:05,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-03-03 18:31:05,251 INFO L435 NwaCegarLoop]: 1161 mSDtfsCounter, 1003 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 4623 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:05,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 4623 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 18:31:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2025-03-03 18:31:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1150. [2025-03-03 18:31:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.4995648389904264) internal successors, (1723), 1149 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1723 transitions. [2025-03-03 18:31:05,277 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1723 transitions. Word has length 157 [2025-03-03 18:31:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:05,277 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1723 transitions. [2025-03-03 18:31:05,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 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-03-03 18:31:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1723 transitions. [2025-03-03 18:31:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 18:31:05,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:05,281 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-03-03 18:31:05,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:31:05,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:05,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1528121273, now seen corresponding path program 1 times [2025-03-03 18:31:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:05,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233326892] [2025-03-03 18:31:05,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:05,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 18:31:06,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 18:31:06,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:06,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:08,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:08,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233326892] [2025-03-03 18:31:08,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233326892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:08,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:08,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:08,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134591478] [2025-03-03 18:31:08,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:08,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:08,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:08,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:08,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:08,077 INFO L87 Difference]: Start difference. First operand 1150 states and 1723 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-03-03 18:31:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:09,122 INFO L93 Difference]: Finished difference Result 2722 states and 4078 transitions. [2025-03-03 18:31:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:09,122 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-03-03 18:31:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:09,127 INFO L225 Difference]: With dead ends: 2722 [2025-03-03 18:31:09,127 INFO L226 Difference]: Without dead ends: 1722 [2025-03-03 18:31:09,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-03 18:31:09,129 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 1001 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:09,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 4624 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 18:31:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2025-03-03 18:31:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1151. [2025-03-03 18:31:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1150 states have (on average 1.4991304347826087) internal successors, (1724), 1150 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1724 transitions. [2025-03-03 18:31:09,152 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1724 transitions. Word has length 158 [2025-03-03 18:31:09,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:09,152 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1724 transitions. [2025-03-03 18:31:09,152 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-03-03 18:31:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1724 transitions. [2025-03-03 18:31:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 18:31:09,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:09,153 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-03-03 18:31:09,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:31:09,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:09,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:09,154 INFO L85 PathProgramCache]: Analyzing trace with hash -12529861, now seen corresponding path program 1 times [2025-03-03 18:31:09,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:09,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758386623] [2025-03-03 18:31:09,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:09,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 18:31:10,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 18:31:10,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:10,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:11,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:11,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758386623] [2025-03-03 18:31:11,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758386623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:11,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:11,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:11,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942984506] [2025-03-03 18:31:11,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:11,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:11,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:11,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:11,906 INFO L87 Difference]: Start difference. First operand 1151 states and 1724 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-03-03 18:31:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:12,738 INFO L93 Difference]: Finished difference Result 2685 states and 4021 transitions. [2025-03-03 18:31:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:31:12,738 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-03-03 18:31:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:12,743 INFO L225 Difference]: With dead ends: 2685 [2025-03-03 18:31:12,743 INFO L226 Difference]: Without dead ends: 1498 [2025-03-03 18:31:12,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:31:12,746 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 3233 mSDsluCounter, 3694 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3233 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:12,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3233 Valid, 4956 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:31:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-03-03 18:31:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1151. [2025-03-03 18:31:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1150 states have (on average 1.4982608695652173) internal successors, (1723), 1150 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1723 transitions. [2025-03-03 18:31:12,764 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1723 transitions. Word has length 159 [2025-03-03 18:31:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:12,764 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1723 transitions. [2025-03-03 18:31:12,764 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-03-03 18:31:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1723 transitions. [2025-03-03 18:31:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 18:31:12,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:12,765 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-03-03 18:31:12,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:31:12,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:12,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:12,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1276177483, now seen corresponding path program 1 times [2025-03-03 18:31:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:12,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490028559] [2025-03-03 18:31:12,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:12,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:12,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 18:31:14,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 18:31:14,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:14,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:15,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-03-03 18:31:15,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:15,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490028559] [2025-03-03 18:31:15,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490028559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:15,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:15,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:15,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613280581] [2025-03-03 18:31:15,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:15,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:15,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:15,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:15,987 INFO L87 Difference]: Start difference. First operand 1151 states and 1723 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-03-03 18:31:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:16,869 INFO L93 Difference]: Finished difference Result 2570 states and 3848 transitions. [2025-03-03 18:31:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:31:16,870 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-03-03 18:31:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:16,873 INFO L225 Difference]: With dead ends: 2570 [2025-03-03 18:31:16,874 INFO L226 Difference]: Without dead ends: 1570 [2025-03-03 18:31:16,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:16,876 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 1432 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 4781 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:16,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 4781 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:31:16,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-03 18:31:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1216. [2025-03-03 18:31:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 1.4979423868312758) internal successors, (1820), 1215 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1820 transitions. [2025-03-03 18:31:16,896 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1820 transitions. Word has length 160 [2025-03-03 18:31:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:16,897 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1820 transitions. [2025-03-03 18:31:16,897 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-03-03 18:31:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1820 transitions. [2025-03-03 18:31:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 18:31:16,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:16,899 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-03-03 18:31:16,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:31:16,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:16,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash -60487471, now seen corresponding path program 1 times [2025-03-03 18:31:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:16,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466510257] [2025-03-03 18:31:16,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:16,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 18:31:18,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 18:31:18,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:18,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:19,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:19,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466510257] [2025-03-03 18:31:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466510257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:19,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:19,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258369344] [2025-03-03 18:31:19,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:19,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:19,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:19,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:19,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:19,517 INFO L87 Difference]: Start difference. First operand 1216 states and 1820 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-03-03 18:31:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:20,411 INFO L93 Difference]: Finished difference Result 2884 states and 4317 transitions. [2025-03-03 18:31:20,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:31:20,411 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-03-03 18:31:20,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:20,416 INFO L225 Difference]: With dead ends: 2884 [2025-03-03 18:31:20,416 INFO L226 Difference]: Without dead ends: 1874 [2025-03-03 18:31:20,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:20,418 INFO L435 NwaCegarLoop]: 1204 mSDtfsCounter, 1198 mSDsluCounter, 4730 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 5934 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:20,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 5934 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:31:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-03-03 18:31:20,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1216. [2025-03-03 18:31:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 1.497119341563786) internal successors, (1819), 1215 states have internal predecessors, (1819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1819 transitions. [2025-03-03 18:31:20,434 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1819 transitions. Word has length 161 [2025-03-03 18:31:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:20,434 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1819 transitions. [2025-03-03 18:31:20,435 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-03-03 18:31:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1819 transitions. [2025-03-03 18:31:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 18:31:20,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:20,436 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-03-03 18:31:20,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:31:20,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:20,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash 322873638, now seen corresponding path program 1 times [2025-03-03 18:31:20,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:20,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757139745] [2025-03-03 18:31:20,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:20,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:20,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 18:31:21,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 18:31:21,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:21,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:22,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:22,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757139745] [2025-03-03 18:31:22,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757139745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:22,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:22,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:22,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070750894] [2025-03-03 18:31:22,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:22,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:22,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:22,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:22,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:22,464 INFO L87 Difference]: Start difference. First operand 1216 states and 1819 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 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-03-03 18:31:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:23,262 INFO L93 Difference]: Finished difference Result 2884 states and 4316 transitions. [2025-03-03 18:31:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:23,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 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-03-03 18:31:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:23,266 INFO L225 Difference]: With dead ends: 2884 [2025-03-03 18:31:23,266 INFO L226 Difference]: Without dead ends: 1874 [2025-03-03 18:31:23,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-03 18:31:23,268 INFO L435 NwaCegarLoop]: 1164 mSDtfsCounter, 1196 mSDsluCounter, 3460 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:23,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 4624 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:31:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-03-03 18:31:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1216. [2025-03-03 18:31:23,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 1.4962962962962962) internal successors, (1818), 1215 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1818 transitions. [2025-03-03 18:31:23,283 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1818 transitions. Word has length 162 [2025-03-03 18:31:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:23,283 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1818 transitions. [2025-03-03 18:31:23,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 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-03-03 18:31:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1818 transitions. [2025-03-03 18:31:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 18:31:23,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:23,285 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-03-03 18:31:23,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:31:23,285 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1176352330, now seen corresponding path program 1 times [2025-03-03 18:31:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164237818] [2025-03-03 18:31:23,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:23,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 18:31:24,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 18:31:24,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:24,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164237818] [2025-03-03 18:31:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164237818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:25,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:25,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772223555] [2025-03-03 18:31:25,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:25,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:25,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:25,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:25,479 INFO L87 Difference]: Start difference. First operand 1216 states and 1818 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 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-03-03 18:31:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:26,260 INFO L93 Difference]: Finished difference Result 2874 states and 4301 transitions. [2025-03-03 18:31:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:26,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 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-03-03 18:31:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:26,264 INFO L225 Difference]: With dead ends: 2874 [2025-03-03 18:31:26,264 INFO L226 Difference]: Without dead ends: 1874 [2025-03-03 18:31:26,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-03 18:31:26,266 INFO L435 NwaCegarLoop]: 1165 mSDtfsCounter, 1187 mSDsluCounter, 3460 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 4625 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:26,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 4625 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:31:26,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2025-03-03 18:31:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1217. [2025-03-03 18:31:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1216 states have (on average 1.495888157894737) internal successors, (1819), 1216 states have internal predecessors, (1819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1819 transitions. [2025-03-03 18:31:26,283 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1819 transitions. Word has length 163 [2025-03-03 18:31:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:26,283 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1819 transitions. [2025-03-03 18:31:26,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 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-03-03 18:31:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1819 transitions. [2025-03-03 18:31:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 18:31:26,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:26,285 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-03-03 18:31:26,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:31:26,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:26,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:26,285 INFO L85 PathProgramCache]: Analyzing trace with hash 539856251, now seen corresponding path program 1 times [2025-03-03 18:31:26,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:26,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162165096] [2025-03-03 18:31:26,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:26,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:26,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 18:31:28,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 18:31:28,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:28,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:29,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:29,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162165096] [2025-03-03 18:31:29,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162165096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:29,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:29,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:29,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118630671] [2025-03-03 18:31:29,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:29,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:29,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:29,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:29,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:29,197 INFO L87 Difference]: Start difference. First operand 1217 states and 1819 transitions. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 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-03-03 18:31:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:29,984 INFO L93 Difference]: Finished difference Result 2701 states and 4037 transitions. [2025-03-03 18:31:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:31:29,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 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-03-03 18:31:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:29,988 INFO L225 Difference]: With dead ends: 2701 [2025-03-03 18:31:29,988 INFO L226 Difference]: Without dead ends: 1570 [2025-03-03 18:31:29,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:29,990 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 799 mSDsluCounter, 4737 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 5948 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:29,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 5948 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:31:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-03 18:31:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1217. [2025-03-03 18:31:30,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1216 states have (on average 1.4950657894736843) internal successors, (1818), 1216 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:30,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1818 transitions. [2025-03-03 18:31:30,006 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1818 transitions. Word has length 164 [2025-03-03 18:31:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:30,006 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1818 transitions. [2025-03-03 18:31:30,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 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-03-03 18:31:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1818 transitions. [2025-03-03 18:31:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 18:31:30,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:30,008 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-03-03 18:31:30,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:31:30,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:30,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash 208259087, now seen corresponding path program 1 times [2025-03-03 18:31:30,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:30,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909533138] [2025-03-03 18:31:30,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:30,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 18:31:31,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 18:31:31,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:31,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:32,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:32,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909533138] [2025-03-03 18:31:32,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909533138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:32,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:32,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603612035] [2025-03-03 18:31:32,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:32,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:32,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:32,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:32,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:32,769 INFO L87 Difference]: Start difference. First operand 1217 states and 1818 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 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-03-03 18:31:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:33,509 INFO L93 Difference]: Finished difference Result 2701 states and 4036 transitions. [2025-03-03 18:31:33,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:33,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 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-03-03 18:31:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:33,513 INFO L225 Difference]: With dead ends: 2701 [2025-03-03 18:31:33,513 INFO L226 Difference]: Without dead ends: 1570 [2025-03-03 18:31:33,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-03 18:31:33,514 INFO L435 NwaCegarLoop]: 1171 mSDtfsCounter, 797 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 4635 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:33,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 4635 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:31:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-03 18:31:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1217. [2025-03-03 18:31:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1216 states have (on average 1.4942434210526316) internal successors, (1817), 1216 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1817 transitions. [2025-03-03 18:31:33,528 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1817 transitions. Word has length 165 [2025-03-03 18:31:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:33,528 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1817 transitions. [2025-03-03 18:31:33,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 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-03-03 18:31:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1817 transitions. [2025-03-03 18:31:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 18:31:33,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:33,529 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-03-03 18:31:33,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:31:33,530 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:33,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash 718074294, now seen corresponding path program 1 times [2025-03-03 18:31:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:33,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355427452] [2025-03-03 18:31:33,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:33,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:33,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 18:31:34,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 18:31:34,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:34,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:35,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:35,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355427452] [2025-03-03 18:31:35,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355427452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:35,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:35,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895891551] [2025-03-03 18:31:35,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:35,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:35,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:35,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:35,859 INFO L87 Difference]: Start difference. First operand 1217 states and 1817 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 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-03-03 18:31:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:36,551 INFO L93 Difference]: Finished difference Result 2657 states and 3967 transitions. [2025-03-03 18:31:36,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:31:36,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 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-03-03 18:31:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:36,558 INFO L225 Difference]: With dead ends: 2657 [2025-03-03 18:31:36,558 INFO L226 Difference]: Without dead ends: 1498 [2025-03-03 18:31:36,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:31:36,560 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 2868 mSDsluCounter, 3595 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2868 SdHoareTripleChecker+Valid, 4810 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:36,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2868 Valid, 4810 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:31:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-03-03 18:31:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1217. [2025-03-03 18:31:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1216 states have (on average 1.493421052631579) internal successors, (1816), 1216 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1816 transitions. [2025-03-03 18:31:36,575 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1816 transitions. Word has length 166 [2025-03-03 18:31:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:36,575 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1816 transitions. [2025-03-03 18:31:36,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 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-03-03 18:31:36,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1816 transitions. [2025-03-03 18:31:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 18:31:36,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:36,576 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-03-03 18:31:36,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:31:36,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:36,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:36,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1101146445, now seen corresponding path program 1 times [2025-03-03 18:31:36,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:36,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899323702] [2025-03-03 18:31:36,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:36,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:36,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 18:31:38,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 18:31:38,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:38,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:39,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:39,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899323702] [2025-03-03 18:31:39,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899323702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:39,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:39,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:39,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589724949] [2025-03-03 18:31:39,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:39,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:39,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:39,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:39,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:39,084 INFO L87 Difference]: Start difference. First operand 1217 states and 1816 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-03-03 18:31:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:39,600 INFO L93 Difference]: Finished difference Result 2392 states and 3571 transitions. [2025-03-03 18:31:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:39,601 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-03-03 18:31:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:39,603 INFO L225 Difference]: With dead ends: 2392 [2025-03-03 18:31:39,603 INFO L226 Difference]: Without dead ends: 1225 [2025-03-03 18:31:39,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:39,605 INFO L435 NwaCegarLoop]: 1170 mSDtfsCounter, 1540 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 3507 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:39,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 3507 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:31:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-03-03 18:31:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1221. [2025-03-03 18:31:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.4918032786885247) internal successors, (1820), 1220 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1820 transitions. [2025-03-03 18:31:39,615 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1820 transitions. Word has length 167 [2025-03-03 18:31:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:39,616 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1820 transitions. [2025-03-03 18:31:39,616 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-03-03 18:31:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1820 transitions. [2025-03-03 18:31:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 18:31:39,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:39,617 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-03-03 18:31:39,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:31:39,617 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:39,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2114524876, now seen corresponding path program 1 times [2025-03-03 18:31:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:39,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106612849] [2025-03-03 18:31:39,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:39,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 18:31:41,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 18:31:41,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:41,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:42,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:42,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106612849] [2025-03-03 18:31:42,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106612849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:42,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:42,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:42,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576290970] [2025-03-03 18:31:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:42,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:42,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:42,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:42,344 INFO L87 Difference]: Start difference. First operand 1221 states and 1820 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 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-03-03 18:31:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:43,161 INFO L93 Difference]: Finished difference Result 2852 states and 4258 transitions. [2025-03-03 18:31:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:31:43,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 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-03-03 18:31:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:43,166 INFO L225 Difference]: With dead ends: 2852 [2025-03-03 18:31:43,166 INFO L226 Difference]: Without dead ends: 1806 [2025-03-03 18:31:43,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:43,167 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 1096 mSDsluCounter, 4736 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 5946 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:43,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 5946 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:31:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2025-03-03 18:31:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1221. [2025-03-03 18:31:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.490983606557377) internal successors, (1819), 1220 states have internal predecessors, (1819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1819 transitions. [2025-03-03 18:31:43,179 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1819 transitions. Word has length 168 [2025-03-03 18:31:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:43,179 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1819 transitions. [2025-03-03 18:31:43,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 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-03-03 18:31:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1819 transitions. [2025-03-03 18:31:43,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 18:31:43,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:43,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:43,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:31:43,180 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:43,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:43,180 INFO L85 PathProgramCache]: Analyzing trace with hash 830190719, now seen corresponding path program 1 times [2025-03-03 18:31:43,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:43,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431389866] [2025-03-03 18:31:43,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:43,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:43,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 18:31:44,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 18:31:44,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:44,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:45,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:45,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431389866] [2025-03-03 18:31:45,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431389866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:45,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:45,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:45,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130661147] [2025-03-03 18:31:45,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:45,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:45,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:45,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:45,412 INFO L87 Difference]: Start difference. First operand 1221 states and 1819 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:46,140 INFO L93 Difference]: Finished difference Result 2852 states and 4257 transitions. [2025-03-03 18:31:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:46,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2025-03-03 18:31:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:46,144 INFO L225 Difference]: With dead ends: 2852 [2025-03-03 18:31:46,144 INFO L226 Difference]: Without dead ends: 1806 [2025-03-03 18:31:46,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-03 18:31:46,146 INFO L435 NwaCegarLoop]: 1170 mSDtfsCounter, 1094 mSDsluCounter, 3460 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 4630 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:46,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 4630 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:31:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2025-03-03 18:31:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1221. [2025-03-03 18:31:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.4901639344262294) internal successors, (1818), 1220 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1818 transitions. [2025-03-03 18:31:46,157 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1818 transitions. Word has length 169 [2025-03-03 18:31:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:46,157 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1818 transitions. [2025-03-03 18:31:46,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1818 transitions. [2025-03-03 18:31:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:31:46,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:46,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:46,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:31:46,158 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:46,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -40308173, now seen corresponding path program 1 times [2025-03-03 18:31:46,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:46,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684460065] [2025-03-03 18:31:46,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:46,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:46,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:31:47,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:31:47,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:47,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:48,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:48,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684460065] [2025-03-03 18:31:48,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684460065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:48,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:48,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:48,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348729198] [2025-03-03 18:31:48,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:48,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:48,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:48,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:48,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:48,894 INFO L87 Difference]: Start difference. First operand 1221 states and 1818 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:49,557 INFO L93 Difference]: Finished difference Result 2805 states and 4182 transitions. [2025-03-03 18:31:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:31:49,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-03-03 18:31:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:49,561 INFO L225 Difference]: With dead ends: 2805 [2025-03-03 18:31:49,561 INFO L226 Difference]: Without dead ends: 1726 [2025-03-03 18:31:49,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:49,563 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 1942 mSDsluCounter, 3584 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1942 SdHoareTripleChecker+Valid, 4798 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:49,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1942 Valid, 4798 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:31:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2025-03-03 18:31:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1221. [2025-03-03 18:31:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.4893442622950819) internal successors, (1817), 1220 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1817 transitions. [2025-03-03 18:31:49,575 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1817 transitions. Word has length 170 [2025-03-03 18:31:49,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:49,575 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1817 transitions. [2025-03-03 18:31:49,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1817 transitions. [2025-03-03 18:31:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 18:31:49,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:49,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:49,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:31:49,577 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:49,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash 230155616, now seen corresponding path program 1 times [2025-03-03 18:31:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978316435] [2025-03-03 18:31:49,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:49,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 18:31:50,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 18:31:50,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:50,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:51,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978316435] [2025-03-03 18:31:51,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978316435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:51,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:51,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921964811] [2025-03-03 18:31:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:51,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:51,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:51,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:51,989 INFO L87 Difference]: Start difference. First operand 1221 states and 1817 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:52,764 INFO L93 Difference]: Finished difference Result 2805 states and 4181 transitions. [2025-03-03 18:31:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:52,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-03-03 18:31:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:52,768 INFO L225 Difference]: With dead ends: 2805 [2025-03-03 18:31:52,769 INFO L226 Difference]: Without dead ends: 1726 [2025-03-03 18:31:52,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-03 18:31:52,770 INFO L435 NwaCegarLoop]: 1174 mSDtfsCounter, 990 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 4636 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:52,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 4636 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:31:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2025-03-03 18:31:52,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1221. [2025-03-03 18:31:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.4885245901639343) internal successors, (1816), 1220 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1816 transitions. [2025-03-03 18:31:52,781 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1816 transitions. Word has length 171 [2025-03-03 18:31:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:52,781 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1816 transitions. [2025-03-03 18:31:52,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1816 transitions. [2025-03-03 18:31:52,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 18:31:52,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:52,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:52,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:31:52,782 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:52,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:52,782 INFO L85 PathProgramCache]: Analyzing trace with hash 873056945, now seen corresponding path program 1 times [2025-03-03 18:31:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203163778] [2025-03-03 18:31:52,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:52,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 18:31:54,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 18:31:54,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:54,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:55,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:55,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:55,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203163778] [2025-03-03 18:31:55,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203163778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:55,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:55,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:55,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323025778] [2025-03-03 18:31:55,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:55,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:55,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:55,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:55,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:55,261 INFO L87 Difference]: Start difference. First operand 1221 states and 1816 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:55,895 INFO L93 Difference]: Finished difference Result 2719 states and 4048 transitions. [2025-03-03 18:31:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:31:55,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2025-03-03 18:31:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:55,898 INFO L225 Difference]: With dead ends: 2719 [2025-03-03 18:31:55,898 INFO L226 Difference]: Without dead ends: 1574 [2025-03-03 18:31:55,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:55,899 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 1550 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 4806 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:55,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 4806 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:31:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2025-03-03 18:31:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1221. [2025-03-03 18:31:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.4877049180327868) internal successors, (1815), 1220 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1815 transitions. [2025-03-03 18:31:55,909 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1815 transitions. Word has length 172 [2025-03-03 18:31:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:55,909 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1815 transitions. [2025-03-03 18:31:55,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1815 transitions. [2025-03-03 18:31:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 18:31:55,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:55,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:55,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 18:31:55,910 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:55,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:55,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1007344200, now seen corresponding path program 1 times [2025-03-03 18:31:55,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:55,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396819614] [2025-03-03 18:31:55,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:55,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:55,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 18:31:57,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 18:31:57,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:57,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:31:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:58,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396819614] [2025-03-03 18:31:58,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396819614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:58,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:58,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:31:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727821683] [2025-03-03 18:31:58,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:58,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:31:58,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:58,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:31:58,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:31:58,333 INFO L87 Difference]: Start difference. First operand 1221 states and 1815 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:59,054 INFO L93 Difference]: Finished difference Result 2719 states and 4047 transitions. [2025-03-03 18:31:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:59,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2025-03-03 18:31:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:59,057 INFO L225 Difference]: With dead ends: 2719 [2025-03-03 18:31:59,057 INFO L226 Difference]: Without dead ends: 1574 [2025-03-03 18:31:59,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-03 18:31:59,058 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 794 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 4642 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:59,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 4642 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:31:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2025-03-03 18:31:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1221. [2025-03-03 18:31:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1220 states have (on average 1.4868852459016393) internal successors, (1814), 1220 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1814 transitions. [2025-03-03 18:31:59,068 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1814 transitions. Word has length 173 [2025-03-03 18:31:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:59,068 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1814 transitions. [2025-03-03 18:31:59,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1814 transitions. [2025-03-03 18:31:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 18:31:59,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:59,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:59,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 18:31:59,070 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:59,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:59,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1243771020, now seen corresponding path program 1 times [2025-03-03 18:31:59,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:59,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026536485] [2025-03-03 18:31:59,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:59,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:59,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 18:32:01,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 18:32:01,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:01,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:01,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:01,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026536485] [2025-03-03 18:32:01,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026536485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:01,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:01,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585930870] [2025-03-03 18:32:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:01,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:01,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:01,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:01,597 INFO L87 Difference]: Start difference. First operand 1221 states and 1814 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:02,301 INFO L93 Difference]: Finished difference Result 2394 states and 3559 transitions. [2025-03-03 18:32:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:02,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-03 18:32:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:02,303 INFO L225 Difference]: With dead ends: 2394 [2025-03-03 18:32:02,303 INFO L226 Difference]: Without dead ends: 1229 [2025-03-03 18:32:02,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:32:02,304 INFO L435 NwaCegarLoop]: 1212 mSDtfsCounter, 1540 mSDsluCounter, 3632 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 4844 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:02,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 4844 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:32:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2025-03-03 18:32:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1225. [2025-03-03 18:32:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1224 states have (on average 1.4852941176470589) internal successors, (1818), 1224 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1818 transitions. [2025-03-03 18:32:02,314 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1818 transitions. Word has length 174 [2025-03-03 18:32:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:02,314 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1818 transitions. [2025-03-03 18:32:02,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1818 transitions. [2025-03-03 18:32:02,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 18:32:02,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:02,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:02,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 18:32:02,315 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:02,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2083733813, now seen corresponding path program 1 times [2025-03-03 18:32:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:02,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112020259] [2025-03-03 18:32:02,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:02,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 18:32:04,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 18:32:04,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:04,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:05,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:05,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112020259] [2025-03-03 18:32:05,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112020259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:05,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:05,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643994750] [2025-03-03 18:32:05,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:05,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:05,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:05,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:05,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:05,600 INFO L87 Difference]: Start difference. First operand 1225 states and 1818 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:06,288 INFO L93 Difference]: Finished difference Result 2846 states and 4240 transitions. [2025-03-03 18:32:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:06,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-03 18:32:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:06,291 INFO L225 Difference]: With dead ends: 2846 [2025-03-03 18:32:06,291 INFO L226 Difference]: Without dead ends: 1810 [2025-03-03 18:32:06,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:06,293 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 2114 mSDsluCounter, 3586 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 4802 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:06,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 4802 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:32:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-03-03 18:32:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1225. [2025-03-03 18:32:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1224 states have (on average 1.4844771241830066) internal successors, (1817), 1224 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1817 transitions. [2025-03-03 18:32:06,303 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1817 transitions. Word has length 174 [2025-03-03 18:32:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:06,304 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1817 transitions. [2025-03-03 18:32:06,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1817 transitions. [2025-03-03 18:32:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 18:32:06,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:06,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:06,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 18:32:06,305 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:06,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:06,305 INFO L85 PathProgramCache]: Analyzing trace with hash 882036209, now seen corresponding path program 1 times [2025-03-03 18:32:06,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:06,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677563126] [2025-03-03 18:32:06,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:06,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:06,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 18:32:07,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 18:32:07,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:07,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:08,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:08,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677563126] [2025-03-03 18:32:08,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677563126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:08,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585063133] [2025-03-03 18:32:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:08,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:08,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:08,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:08,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:08,653 INFO L87 Difference]: Start difference. First operand 1225 states and 1817 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:09,373 INFO L93 Difference]: Finished difference Result 2846 states and 4239 transitions. [2025-03-03 18:32:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:09,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2025-03-03 18:32:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:09,378 INFO L225 Difference]: With dead ends: 2846 [2025-03-03 18:32:09,378 INFO L226 Difference]: Without dead ends: 1810 [2025-03-03 18:32:09,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-03 18:32:09,380 INFO L435 NwaCegarLoop]: 1176 mSDtfsCounter, 1076 mSDsluCounter, 3460 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 4636 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:09,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 4636 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:32:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-03-03 18:32:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1225. [2025-03-03 18:32:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1224 states have (on average 1.4836601307189543) internal successors, (1816), 1224 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1816 transitions. [2025-03-03 18:32:09,390 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1816 transitions. Word has length 175 [2025-03-03 18:32:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:09,391 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1816 transitions. [2025-03-03 18:32:09,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1816 transitions. [2025-03-03 18:32:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 18:32:09,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:09,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:09,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 18:32:09,392 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:09,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash -292329120, now seen corresponding path program 1 times [2025-03-03 18:32:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440643476] [2025-03-03 18:32:09,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:09,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes.