./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-9.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64112e1b749b3f3bd1f90e7c6ef1307c373f22395af003cd405b370514a79ebf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:51:48,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:51:48,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:51:48,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:51:48,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:51:48,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:51:48,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:51:48,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:51:48,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:51:48,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:51:48,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:51:48,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:51:48,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:51:48,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:51:48,307 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:51:48,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:51:48,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:51:48,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:51:48,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:51:48,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:51:48,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:51:48,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:51:48,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:51:48,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:51:48,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:51:48,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:51:48,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:51:48,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:51:48,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:51:48,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:51:48,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:51:48,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:51:48,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:51:48,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:51:48,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:51:48,311 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64112e1b749b3f3bd1f90e7c6ef1307c373f22395af003cd405b370514a79ebf [2025-01-09 14:51:48,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:51:48,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:51:48,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:51:48,544 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:51:48,544 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:51:48,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-9.i [2025-01-09 14:51:49,700 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c883307f/e7b6275c833c4145b2bdfdd794cd78bc/FLAGb550a3448 [2025-01-09 14:51:49,981 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:51:49,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-9.i [2025-01-09 14:51:49,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c883307f/e7b6275c833c4145b2bdfdd794cd78bc/FLAGb550a3448 [2025-01-09 14:51:50,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c883307f/e7b6275c833c4145b2bdfdd794cd78bc [2025-01-09 14:51:50,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:51:50,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:51:50,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:51:50,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:51:50,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:51:50,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589f9d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50, skipping insertion in model container [2025-01-09 14:51:50,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:51:50,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-9.i[915,928] [2025-01-09 14:51:50,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:51:50,679 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:51:50,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-9.i[915,928] [2025-01-09 14:51:50,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:51:50,770 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:51:50,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50 WrapperNode [2025-01-09 14:51:50,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:51:50,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:51:50,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:51:50,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:51:50,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,860 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 925 [2025-01-09 14:51:50,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:51:50,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:51:50,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:51:50,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:51:50,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,935 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:51:50,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,983 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:50,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:51,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:51,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:51,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:51:51,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:51:51,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:51:51,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:51:51,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (1/1) ... [2025-01-09 14:51:51,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:51:51,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:51,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:51:51,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:51:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:51:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:51:51,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:51:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:51:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:51:51,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:51:51,207 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:51:51,209 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:51:52,358 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-01-09 14:51:52,358 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:51:52,383 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:51:52,386 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:51:52,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:51:52 BoogieIcfgContainer [2025-01-09 14:51:52,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:51:52,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:51:52,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:51:52,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:51:52,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:51:50" (1/3) ... [2025-01-09 14:51:52,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ff9e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:51:52, skipping insertion in model container [2025-01-09 14:51:52,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:50" (2/3) ... [2025-01-09 14:51:52,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ff9e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:51:52, skipping insertion in model container [2025-01-09 14:51:52,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:51:52" (3/3) ... [2025-01-09 14:51:52,395 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-9.i [2025-01-09 14:51:52,406 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:51:52,409 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-9.i that has 2 procedures, 374 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:51:52,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:51:52,486 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;@5f3537c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:51:52,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:51:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 291 states have (on average 1.5257731958762886) internal successors, (444), 292 states have internal predecessors, (444), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 14:51:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-01-09 14:51:52,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:52,518 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:52,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:52,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1297213051, now seen corresponding path program 1 times [2025-01-09 14:51:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:52,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736339781] [2025-01-09 14:51:52,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:52,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-09 14:51:52,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-09 14:51:52,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:52,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-01-09 14:51:53,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:53,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736339781] [2025-01-09 14:51:53,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736339781] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:51:53,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119127265] [2025-01-09 14:51:53,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:53,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:53,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:53,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:51:53,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:51:53,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-09 14:51:53,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-09 14:51:53,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:53,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:53,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:51:53,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:51:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-01-09 14:51:53,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:51:53,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119127265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:53,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:51:53,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:51:53,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596530414] [2025-01-09 14:51:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:53,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:51:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:53,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:51:53,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:51:53,575 INFO L87 Difference]: Start difference. First operand has 374 states, 291 states have (on average 1.5257731958762886) internal successors, (444), 292 states have internal predecessors, (444), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 14:51:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:53,624 INFO L93 Difference]: Finished difference Result 742 states and 1283 transitions. [2025-01-09 14:51:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:51:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 567 [2025-01-09 14:51:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:53,632 INFO L225 Difference]: With dead ends: 742 [2025-01-09 14:51:53,632 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 14:51:53,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:51:53,638 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:53,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:51:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 14:51:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-01-09 14:51:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 289 states have (on average 1.519031141868512) internal successors, (439), 289 states have internal predecessors, (439), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 14:51:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 599 transitions. [2025-01-09 14:51:53,705 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 599 transitions. Word has length 567 [2025-01-09 14:51:53,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:53,706 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 599 transitions. [2025-01-09 14:51:53,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 14:51:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 599 transitions. [2025-01-09 14:51:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-01-09 14:51:53,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:53,718 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:53,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:51:53,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:51:53,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:53,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2039478933, now seen corresponding path program 1 times [2025-01-09 14:51:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107063134] [2025-01-09 14:51:53,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:53,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-09 14:51:54,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-09 14:51:54,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:54,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:51:55,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:55,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107063134] [2025-01-09 14:51:55,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107063134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:55,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:55,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:51:55,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554843970] [2025-01-09 14:51:55,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:55,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:51:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:55,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:51:55,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:55,116 INFO L87 Difference]: Start difference. First operand 371 states and 599 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:55,538 INFO L93 Difference]: Finished difference Result 1112 states and 1799 transitions. [2025-01-09 14:51:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:51:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 567 [2025-01-09 14:51:55,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:55,548 INFO L225 Difference]: With dead ends: 1112 [2025-01-09 14:51:55,549 INFO L226 Difference]: Without dead ends: 744 [2025-01-09 14:51:55,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:51:55,554 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 661 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:55,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 2332 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:51:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-01-09 14:51:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 682. [2025-01-09 14:51:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 519 states have (on average 1.5202312138728324) internal successors, (789), 519 states have internal predecessors, (789), 160 states have call successors, (160), 2 states have call predecessors, (160), 2 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 14:51:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1109 transitions. [2025-01-09 14:51:55,643 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1109 transitions. Word has length 567 [2025-01-09 14:51:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:55,644 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1109 transitions. [2025-01-09 14:51:55,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1109 transitions. [2025-01-09 14:51:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-01-09 14:51:55,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:55,656 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:55,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:51:55,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:55,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1752273994, now seen corresponding path program 1 times [2025-01-09 14:51:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:55,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357936863] [2025-01-09 14:51:55,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:55,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-01-09 14:51:55,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-01-09 14:51:55,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:55,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:51:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357936863] [2025-01-09 14:51:56,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357936863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:56,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766621341] [2025-01-09 14:51:56,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:56,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:56,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:56,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:56,198 INFO L87 Difference]: Start difference. First operand 682 states and 1109 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:56,604 INFO L93 Difference]: Finished difference Result 1926 states and 3146 transitions. [2025-01-09 14:51:56,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:56,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 568 [2025-01-09 14:51:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:56,612 INFO L225 Difference]: With dead ends: 1926 [2025-01-09 14:51:56,613 INFO L226 Difference]: Without dead ends: 1399 [2025-01-09 14:51:56,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:56,615 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 812 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:56,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2064 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:51:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-01-09 14:51:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1323. [2025-01-09 14:51:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1079 states have (on average 1.562557924003707) internal successors, (1686), 1079 states have internal predecessors, (1686), 240 states have call successors, (240), 3 states have call predecessors, (240), 3 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-01-09 14:51:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2166 transitions. [2025-01-09 14:51:56,706 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2166 transitions. Word has length 568 [2025-01-09 14:51:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:56,706 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 2166 transitions. [2025-01-09 14:51:56,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2166 transitions. [2025-01-09 14:51:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-01-09 14:51:56,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:56,714 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:56,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:51:56,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:56,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash 922851997, now seen corresponding path program 1 times [2025-01-09 14:51:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:56,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357426651] [2025-01-09 14:51:56,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:56,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:56,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-01-09 14:51:56,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-01-09 14:51:56,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:56,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:51:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:57,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357426651] [2025-01-09 14:51:57,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357426651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:57,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:57,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:57,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932259585] [2025-01-09 14:51:57,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:57,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:57,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:57,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:57,086 INFO L87 Difference]: Start difference. First operand 1323 states and 2166 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:57,451 INFO L93 Difference]: Finished difference Result 3941 states and 6451 transitions. [2025-01-09 14:51:57,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:57,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 569 [2025-01-09 14:51:57,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:57,467 INFO L225 Difference]: With dead ends: 3941 [2025-01-09 14:51:57,467 INFO L226 Difference]: Without dead ends: 2773 [2025-01-09 14:51:57,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:57,475 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 1057 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:57,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1753 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:51:57,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2025-01-09 14:51:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 2627. [2025-01-09 14:51:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2221 states have (on average 1.5776677172444844) internal successors, (3504), 2221 states have internal predecessors, (3504), 400 states have call successors, (400), 5 states have call predecessors, (400), 5 states have return successors, (400), 400 states have call predecessors, (400), 400 states have call successors, (400) [2025-01-09 14:51:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 4304 transitions. [2025-01-09 14:51:57,630 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 4304 transitions. Word has length 569 [2025-01-09 14:51:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:57,631 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 4304 transitions. [2025-01-09 14:51:57,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 4304 transitions. [2025-01-09 14:51:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-01-09 14:51:57,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:57,636 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:57,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:51:57,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:57,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash 342627717, now seen corresponding path program 1 times [2025-01-09 14:51:57,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:57,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685547275] [2025-01-09 14:51:57,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:57,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-01-09 14:51:57,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-01-09 14:51:57,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:57,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:51:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685547275] [2025-01-09 14:51:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685547275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:57,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:57,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:57,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848339332] [2025-01-09 14:51:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:57,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:57,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:57,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:57,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:57,866 INFO L87 Difference]: Start difference. First operand 2627 states and 4304 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:58,036 INFO L93 Difference]: Finished difference Result 7543 states and 12373 transitions. [2025-01-09 14:51:58,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:58,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 570 [2025-01-09 14:51:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:58,061 INFO L225 Difference]: With dead ends: 7543 [2025-01-09 14:51:58,062 INFO L226 Difference]: Without dead ends: 5077 [2025-01-09 14:51:58,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:58,071 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 571 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:58,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1171 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:51:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2025-01-09 14:51:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 5075. [2025-01-09 14:51:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 4345 states have (on average 1.5739930955120829) internal successors, (6839), 4345 states have internal predecessors, (6839), 720 states have call successors, (720), 9 states have call predecessors, (720), 9 states have return successors, (720), 720 states have call predecessors, (720), 720 states have call successors, (720) [2025-01-09 14:51:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 8279 transitions. [2025-01-09 14:51:58,303 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 8279 transitions. Word has length 570 [2025-01-09 14:51:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:58,304 INFO L471 AbstractCegarLoop]: Abstraction has 5075 states and 8279 transitions. [2025-01-09 14:51:58,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 8279 transitions. [2025-01-09 14:51:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 14:51:58,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:58,312 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:58,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:51:58,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:58,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:58,313 INFO L85 PathProgramCache]: Analyzing trace with hash -65437553, now seen corresponding path program 1 times [2025-01-09 14:51:58,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:58,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712547401] [2025-01-09 14:51:58,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:58,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:58,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:51:58,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:51:58,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:58,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:51:58,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:58,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712547401] [2025-01-09 14:51:58,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712547401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:58,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:58,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:58,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041935039] [2025-01-09 14:51:58,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:58,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:58,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:58,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:58,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:58,548 INFO L87 Difference]: Start difference. First operand 5075 states and 8279 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:58,797 INFO L93 Difference]: Finished difference Result 14489 states and 23633 transitions. [2025-01-09 14:51:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:58,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 571 [2025-01-09 14:51:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:58,847 INFO L225 Difference]: With dead ends: 14489 [2025-01-09 14:51:58,847 INFO L226 Difference]: Without dead ends: 9720 [2025-01-09 14:51:58,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:58,860 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 570 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:58,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1444 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:51:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9720 states. [2025-01-09 14:51:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9720 to 5779. [2025-01-09 14:51:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5779 states, 5049 states have (on average 1.589027530204001) internal successors, (8023), 5049 states have internal predecessors, (8023), 720 states have call successors, (720), 9 states have call predecessors, (720), 9 states have return successors, (720), 720 states have call predecessors, (720), 720 states have call successors, (720) [2025-01-09 14:51:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5779 states to 5779 states and 9463 transitions. [2025-01-09 14:51:59,224 INFO L78 Accepts]: Start accepts. Automaton has 5779 states and 9463 transitions. Word has length 571 [2025-01-09 14:51:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:59,225 INFO L471 AbstractCegarLoop]: Abstraction has 5779 states and 9463 transitions. [2025-01-09 14:51:59,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5779 states and 9463 transitions. [2025-01-09 14:51:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 14:51:59,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:59,236 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:59,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:51:59,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:59,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1980935353, now seen corresponding path program 1 times [2025-01-09 14:51:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:59,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797192355] [2025-01-09 14:51:59,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:59,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:51:59,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:51:59,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:59,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:51:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:59,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797192355] [2025-01-09 14:51:59,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797192355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:59,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:59,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397973773] [2025-01-09 14:51:59,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:59,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:59,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:59,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:59,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:59,476 INFO L87 Difference]: Start difference. First operand 5779 states and 9463 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:51:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:59,720 INFO L93 Difference]: Finished difference Result 16425 states and 26913 transitions. [2025-01-09 14:51:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:59,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 571 [2025-01-09 14:51:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:59,771 INFO L225 Difference]: With dead ends: 16425 [2025-01-09 14:51:59,772 INFO L226 Difference]: Without dead ends: 11076 [2025-01-09 14:51:59,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:59,787 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 568 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:59,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1174 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:51:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11076 states. [2025-01-09 14:52:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11076 to 9478. [2025-01-09 14:52:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9478 states, 8748 states have (on average 1.6143118427069045) internal successors, (14122), 8748 states have internal predecessors, (14122), 720 states have call successors, (720), 9 states have call predecessors, (720), 9 states have return successors, (720), 720 states have call predecessors, (720), 720 states have call successors, (720) [2025-01-09 14:52:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9478 states to 9478 states and 15562 transitions. [2025-01-09 14:52:00,166 INFO L78 Accepts]: Start accepts. Automaton has 9478 states and 15562 transitions. Word has length 571 [2025-01-09 14:52:00,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:00,167 INFO L471 AbstractCegarLoop]: Abstraction has 9478 states and 15562 transitions. [2025-01-09 14:52:00,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 9478 states and 15562 transitions. [2025-01-09 14:52:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 14:52:00,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:00,176 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:00,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:52:00,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:00,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:00,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1758657401, now seen corresponding path program 1 times [2025-01-09 14:52:00,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:00,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091257741] [2025-01-09 14:52:00,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:00,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:00,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:52:00,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:52:00,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:00,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:00,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:00,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091257741] [2025-01-09 14:52:00,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091257741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:00,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:00,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:00,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068173844] [2025-01-09 14:52:00,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:00,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:00,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:00,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:00,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:00,816 INFO L87 Difference]: Start difference. First operand 9478 states and 15562 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:01,266 INFO L93 Difference]: Finished difference Result 15618 states and 25590 transitions. [2025-01-09 14:52:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:01,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 571 [2025-01-09 14:52:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:01,298 INFO L225 Difference]: With dead ends: 15618 [2025-01-09 14:52:01,298 INFO L226 Difference]: Without dead ends: 11606 [2025-01-09 14:52:01,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:01,312 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 285 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:01,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1587 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:52:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11606 states. [2025-01-09 14:52:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11606 to 10398. [2025-01-09 14:52:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10398 states, 9668 states have (on average 1.6199834505585438) internal successors, (15662), 9668 states have internal predecessors, (15662), 720 states have call successors, (720), 9 states have call predecessors, (720), 9 states have return successors, (720), 720 states have call predecessors, (720), 720 states have call successors, (720) [2025-01-09 14:52:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10398 states to 10398 states and 17102 transitions. [2025-01-09 14:52:01,599 INFO L78 Accepts]: Start accepts. Automaton has 10398 states and 17102 transitions. Word has length 571 [2025-01-09 14:52:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:01,601 INFO L471 AbstractCegarLoop]: Abstraction has 10398 states and 17102 transitions. [2025-01-09 14:52:01,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 10398 states and 17102 transitions. [2025-01-09 14:52:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 14:52:01,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:01,669 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:01,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:52:01,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:01,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:01,670 INFO L85 PathProgramCache]: Analyzing trace with hash 507723785, now seen corresponding path program 1 times [2025-01-09 14:52:01,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:01,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646423482] [2025-01-09 14:52:01,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:01,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:01,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:52:01,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:52:01,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:01,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646423482] [2025-01-09 14:52:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646423482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:52:02,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081849690] [2025-01-09 14:52:02,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:02,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:52:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:02,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:52:02,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:52:02,184 INFO L87 Difference]: Start difference. First operand 10398 states and 17102 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2025-01-09 14:52:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:03,014 INFO L93 Difference]: Finished difference Result 34434 states and 56442 transitions. [2025-01-09 14:52:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:52:03,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) Word has length 571 [2025-01-09 14:52:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:03,071 INFO L225 Difference]: With dead ends: 34434 [2025-01-09 14:52:03,071 INFO L226 Difference]: Without dead ends: 26174 [2025-01-09 14:52:03,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:52:03,098 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1691 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:03,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 2579 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:52:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26174 states. [2025-01-09 14:52:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26174 to 25898. [2025-01-09 14:52:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25898 states, 24447 states have (on average 1.614881171513887) internal successors, (39479), 24455 states have internal predecessors, (39479), 1424 states have call successors, (1424), 26 states have call predecessors, (1424), 26 states have return successors, (1424), 1416 states have call predecessors, (1424), 1424 states have call successors, (1424) [2025-01-09 14:52:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25898 states to 25898 states and 42327 transitions. [2025-01-09 14:52:03,743 INFO L78 Accepts]: Start accepts. Automaton has 25898 states and 42327 transitions. Word has length 571 [2025-01-09 14:52:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:03,744 INFO L471 AbstractCegarLoop]: Abstraction has 25898 states and 42327 transitions. [2025-01-09 14:52:03,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2025-01-09 14:52:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 25898 states and 42327 transitions. [2025-01-09 14:52:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-01-09 14:52:03,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:03,757 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:03,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:52:03,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:03,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1297714549, now seen corresponding path program 1 times [2025-01-09 14:52:03,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:03,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569922545] [2025-01-09 14:52:03,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:03,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:03,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-01-09 14:52:03,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-01-09 14:52:03,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:03,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:04,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:04,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569922545] [2025-01-09 14:52:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569922545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:04,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145780930] [2025-01-09 14:52:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:04,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:04,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:04,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:04,258 INFO L87 Difference]: Start difference. First operand 25898 states and 42327 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:04,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:04,997 INFO L93 Difference]: Finished difference Result 54041 states and 87998 transitions. [2025-01-09 14:52:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:04,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 571 [2025-01-09 14:52:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:05,062 INFO L225 Difference]: With dead ends: 54041 [2025-01-09 14:52:05,063 INFO L226 Difference]: Without dead ends: 28302 [2025-01-09 14:52:05,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:05,107 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 802 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:05,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2054 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28302 states. [2025-01-09 14:52:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28302 to 25958. [2025-01-09 14:52:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25958 states, 24507 states have (on average 1.6107234667645978) internal successors, (39474), 24515 states have internal predecessors, (39474), 1424 states have call successors, (1424), 26 states have call predecessors, (1424), 26 states have return successors, (1424), 1416 states have call predecessors, (1424), 1424 states have call successors, (1424) [2025-01-09 14:52:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25958 states to 25958 states and 42322 transitions. [2025-01-09 14:52:05,752 INFO L78 Accepts]: Start accepts. Automaton has 25958 states and 42322 transitions. Word has length 571 [2025-01-09 14:52:05,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:05,753 INFO L471 AbstractCegarLoop]: Abstraction has 25958 states and 42322 transitions. [2025-01-09 14:52:05,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 25958 states and 42322 transitions. [2025-01-09 14:52:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-01-09 14:52:05,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:05,766 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:05,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:52:05,767 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:05,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:05,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2105376010, now seen corresponding path program 1 times [2025-01-09 14:52:05,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:05,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529395248] [2025-01-09 14:52:05,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:05,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-01-09 14:52:05,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-01-09 14:52:05,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:05,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:06,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:06,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529395248] [2025-01-09 14:52:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529395248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:06,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:06,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:06,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982126142] [2025-01-09 14:52:06,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:06,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:06,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:06,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:06,512 INFO L87 Difference]: Start difference. First operand 25958 states and 42322 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:07,313 INFO L93 Difference]: Finished difference Result 87148 states and 142287 transitions. [2025-01-09 14:52:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:07,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 572 [2025-01-09 14:52:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:07,424 INFO L225 Difference]: With dead ends: 87148 [2025-01-09 14:52:07,424 INFO L226 Difference]: Without dead ends: 61352 [2025-01-09 14:52:07,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:07,460 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 879 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1988 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:07,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1988 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61352 states. [2025-01-09 14:52:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61352 to 52604. [2025-01-09 14:52:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52604 states, 50681 states have (on average 1.627197569108739) internal successors, (82468), 50713 states have internal predecessors, (82468), 1872 states have call successors, (1872), 50 states have call predecessors, (1872), 50 states have return successors, (1872), 1840 states have call predecessors, (1872), 1872 states have call successors, (1872) [2025-01-09 14:52:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52604 states to 52604 states and 86212 transitions. [2025-01-09 14:52:08,764 INFO L78 Accepts]: Start accepts. Automaton has 52604 states and 86212 transitions. Word has length 572 [2025-01-09 14:52:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:08,766 INFO L471 AbstractCegarLoop]: Abstraction has 52604 states and 86212 transitions. [2025-01-09 14:52:08,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 52604 states and 86212 transitions. [2025-01-09 14:52:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-01-09 14:52:08,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:08,797 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:08,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:52:08,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:08,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:08,798 INFO L85 PathProgramCache]: Analyzing trace with hash 590437450, now seen corresponding path program 1 times [2025-01-09 14:52:08,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:08,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331107526] [2025-01-09 14:52:08,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:08,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:08,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-01-09 14:52:08,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-01-09 14:52:08,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:08,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331107526] [2025-01-09 14:52:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331107526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:09,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:52:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630429458] [2025-01-09 14:52:09,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:09,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:52:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:09,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:52:09,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:09,341 INFO L87 Difference]: Start difference. First operand 52604 states and 86212 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:10,219 INFO L93 Difference]: Finished difference Result 82212 states and 134559 transitions. [2025-01-09 14:52:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:52:10,220 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), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 572 [2025-01-09 14:52:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:10,331 INFO L225 Difference]: With dead ends: 82212 [2025-01-09 14:52:10,331 INFO L226 Difference]: Without dead ends: 55729 [2025-01-09 14:52:10,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:52:10,375 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 561 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:10,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 2346 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:52:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55729 states. [2025-01-09 14:52:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55729 to 50458. [2025-01-09 14:52:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50458 states, 48535 states have (on average 1.6281652415782426) internal successors, (79023), 48567 states have internal predecessors, (79023), 1872 states have call successors, (1872), 50 states have call predecessors, (1872), 50 states have return successors, (1872), 1840 states have call predecessors, (1872), 1872 states have call successors, (1872) [2025-01-09 14:52:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50458 states to 50458 states and 82767 transitions. [2025-01-09 14:52:11,318 INFO L78 Accepts]: Start accepts. Automaton has 50458 states and 82767 transitions. Word has length 572 [2025-01-09 14:52:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:11,318 INFO L471 AbstractCegarLoop]: Abstraction has 50458 states and 82767 transitions. [2025-01-09 14:52:11,319 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), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 50458 states and 82767 transitions. [2025-01-09 14:52:11,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-01-09 14:52:11,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:11,330 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:11,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:52:11,330 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:11,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1622378482, now seen corresponding path program 1 times [2025-01-09 14:52:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:11,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667690534] [2025-01-09 14:52:11,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:11,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-01-09 14:52:11,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-01-09 14:52:11,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:11,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:11,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:11,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667690534] [2025-01-09 14:52:11,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667690534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:11,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:11,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:11,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386905364] [2025-01-09 14:52:11,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:11,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:11,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:11,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:11,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:11,764 INFO L87 Difference]: Start difference. First operand 50458 states and 82767 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:12,607 INFO L93 Difference]: Finished difference Result 99862 states and 163771 transitions. [2025-01-09 14:52:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:12,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 572 [2025-01-09 14:52:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:12,715 INFO L225 Difference]: With dead ends: 99862 [2025-01-09 14:52:12,715 INFO L226 Difference]: Without dead ends: 50460 [2025-01-09 14:52:12,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:12,774 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 393 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:12,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1593 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50460 states. [2025-01-09 14:52:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50460 to 50458. [2025-01-09 14:52:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50458 states, 48535 states have (on average 1.6259812506438653) internal successors, (78917), 48567 states have internal predecessors, (78917), 1872 states have call successors, (1872), 50 states have call predecessors, (1872), 50 states have return successors, (1872), 1840 states have call predecessors, (1872), 1872 states have call successors, (1872) [2025-01-09 14:52:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50458 states to 50458 states and 82661 transitions. [2025-01-09 14:52:14,059 INFO L78 Accepts]: Start accepts. Automaton has 50458 states and 82661 transitions. Word has length 572 [2025-01-09 14:52:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:14,060 INFO L471 AbstractCegarLoop]: Abstraction has 50458 states and 82661 transitions. [2025-01-09 14:52:14,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 50458 states and 82661 transitions. [2025-01-09 14:52:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-01-09 14:52:14,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:14,072 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:14,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:52:14,072 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:14,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2103458740, now seen corresponding path program 1 times [2025-01-09 14:52:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:14,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866243401] [2025-01-09 14:52:14,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:14,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:14,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-01-09 14:52:14,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-01-09 14:52:14,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:14,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:14,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866243401] [2025-01-09 14:52:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866243401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:14,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058216654] [2025-01-09 14:52:14,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:14,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:14,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:14,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:14,727 INFO L87 Difference]: Start difference. First operand 50458 states and 82661 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:15,402 INFO L93 Difference]: Finished difference Result 106041 states and 173332 transitions. [2025-01-09 14:52:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:15,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 572 [2025-01-09 14:52:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:15,496 INFO L225 Difference]: With dead ends: 106041 [2025-01-09 14:52:15,496 INFO L226 Difference]: Without dead ends: 55728 [2025-01-09 14:52:15,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:15,555 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 630 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:15,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1752 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55728 states. [2025-01-09 14:52:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55728 to 50457. [2025-01-09 14:52:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50457 states, 48534 states have (on average 1.6254790456175052) internal successors, (78891), 48566 states have internal predecessors, (78891), 1872 states have call successors, (1872), 50 states have call predecessors, (1872), 50 states have return successors, (1872), 1840 states have call predecessors, (1872), 1872 states have call successors, (1872) [2025-01-09 14:52:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50457 states to 50457 states and 82635 transitions. [2025-01-09 14:52:16,666 INFO L78 Accepts]: Start accepts. Automaton has 50457 states and 82635 transitions. Word has length 572 [2025-01-09 14:52:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:16,669 INFO L471 AbstractCegarLoop]: Abstraction has 50457 states and 82635 transitions. [2025-01-09 14:52:16,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 50457 states and 82635 transitions. [2025-01-09 14:52:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-01-09 14:52:16,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:16,684 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:16,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:52:16,684 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:16,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:16,685 INFO L85 PathProgramCache]: Analyzing trace with hash 699003988, now seen corresponding path program 1 times [2025-01-09 14:52:16,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:16,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792965597] [2025-01-09 14:52:16,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:16,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:16,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-01-09 14:52:16,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-01-09 14:52:16,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:16,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:17,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792965597] [2025-01-09 14:52:17,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792965597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:17,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:17,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:52:17,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838714663] [2025-01-09 14:52:17,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:17,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:52:17,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:17,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:52:17,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:17,373 INFO L87 Difference]: Start difference. First operand 50457 states and 82635 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:18,300 INFO L93 Difference]: Finished difference Result 106037 states and 173277 transitions. [2025-01-09 14:52:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:52:18,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 573 [2025-01-09 14:52:18,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:18,385 INFO L225 Difference]: With dead ends: 106037 [2025-01-09 14:52:18,385 INFO L226 Difference]: Without dead ends: 55728 [2025-01-09 14:52:18,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:52:18,431 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 629 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:18,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 2336 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:18,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55728 states. [2025-01-09 14:52:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55728 to 50457. [2025-01-09 14:52:19,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50457 states, 48534 states have (on average 1.6254584415049245) internal successors, (78890), 48566 states have internal predecessors, (78890), 1872 states have call successors, (1872), 50 states have call predecessors, (1872), 50 states have return successors, (1872), 1840 states have call predecessors, (1872), 1872 states have call successors, (1872) [2025-01-09 14:52:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50457 states to 50457 states and 82634 transitions. [2025-01-09 14:52:19,325 INFO L78 Accepts]: Start accepts. Automaton has 50457 states and 82634 transitions. Word has length 573 [2025-01-09 14:52:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:19,325 INFO L471 AbstractCegarLoop]: Abstraction has 50457 states and 82634 transitions. [2025-01-09 14:52:19,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 50457 states and 82634 transitions. [2025-01-09 14:52:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-01-09 14:52:19,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:19,334 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:19,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:52:19,334 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:19,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:19,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1022280879, now seen corresponding path program 1 times [2025-01-09 14:52:19,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:19,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140241058] [2025-01-09 14:52:19,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:19,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:19,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-01-09 14:52:19,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-01-09 14:52:19,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:19,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:21,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:21,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140241058] [2025-01-09 14:52:21,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140241058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:21,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:21,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:52:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385273059] [2025-01-09 14:52:21,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:21,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:52:21,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:21,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:52:21,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:52:21,372 INFO L87 Difference]: Start difference. First operand 50457 states and 82634 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 14:52:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:23,513 INFO L93 Difference]: Finished difference Result 159031 states and 258498 transitions. [2025-01-09 14:52:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:52:23,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 574 [2025-01-09 14:52:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:23,668 INFO L225 Difference]: With dead ends: 159031 [2025-01-09 14:52:23,668 INFO L226 Difference]: Without dead ends: 110223 [2025-01-09 14:52:23,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:52:23,718 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 2929 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2929 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:23,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2929 Valid, 2186 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 14:52:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110223 states. [2025-01-09 14:52:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110223 to 89399. [2025-01-09 14:52:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89399 states, 85748 states have (on average 1.6187666184634044) internal successors, (138806), 85796 states have internal predecessors, (138806), 3536 states have call successors, (3536), 114 states have call predecessors, (3536), 114 states have return successors, (3536), 3488 states have call predecessors, (3536), 3536 states have call successors, (3536) [2025-01-09 14:52:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89399 states to 89399 states and 145878 transitions. [2025-01-09 14:52:25,498 INFO L78 Accepts]: Start accepts. Automaton has 89399 states and 145878 transitions. Word has length 574 [2025-01-09 14:52:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:25,498 INFO L471 AbstractCegarLoop]: Abstraction has 89399 states and 145878 transitions. [2025-01-09 14:52:25,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2025-01-09 14:52:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 89399 states and 145878 transitions. [2025-01-09 14:52:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-01-09 14:52:25,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:25,511 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:25,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:52:25,511 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:25,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1293930166, now seen corresponding path program 1 times [2025-01-09 14:52:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:25,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720404643] [2025-01-09 14:52:25,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:25,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-01-09 14:52:25,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-01-09 14:52:25,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:25,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:25,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:25,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720404643] [2025-01-09 14:52:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720404643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72971720] [2025-01-09 14:52:25,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:25,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:25,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:25,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:25,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:25,876 INFO L87 Difference]: Start difference. First operand 89399 states and 145878 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:28,296 INFO L93 Difference]: Finished difference Result 303027 states and 492357 transitions. [2025-01-09 14:52:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:28,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 575 [2025-01-09 14:52:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:28,724 INFO L225 Difference]: With dead ends: 303027 [2025-01-09 14:52:28,724 INFO L226 Difference]: Without dead ends: 214783 [2025-01-09 14:52:28,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:28,874 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 747 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:28,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1939 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:52:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214783 states. [2025-01-09 14:52:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214783 to 211419. [2025-01-09 14:52:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211419 states, 204200 states have (on average 1.604613124387855) internal successors, (327662), 204296 states have internal predecessors, (327662), 6992 states have call successors, (6992), 226 states have call predecessors, (6992), 226 states have return successors, (6992), 6896 states have call predecessors, (6992), 6992 states have call successors, (6992) [2025-01-09 14:52:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211419 states to 211419 states and 341646 transitions. [2025-01-09 14:52:33,806 INFO L78 Accepts]: Start accepts. Automaton has 211419 states and 341646 transitions. Word has length 575 [2025-01-09 14:52:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:33,807 INFO L471 AbstractCegarLoop]: Abstraction has 211419 states and 341646 transitions. [2025-01-09 14:52:33,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 211419 states and 341646 transitions. [2025-01-09 14:52:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-01-09 14:52:33,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:33,837 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:33,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:52:33,838 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:33,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:33,838 INFO L85 PathProgramCache]: Analyzing trace with hash -959176907, now seen corresponding path program 1 times [2025-01-09 14:52:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:33,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373016752] [2025-01-09 14:52:33,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:33,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:34,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-01-09 14:52:34,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-01-09 14:52:34,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:34,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:34,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373016752] [2025-01-09 14:52:34,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373016752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:34,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:34,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:34,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355770583] [2025-01-09 14:52:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:34,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:34,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:34,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:34,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:34,648 INFO L87 Difference]: Start difference. First operand 211419 states and 341646 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:38,049 INFO L93 Difference]: Finished difference Result 427575 states and 689861 transitions. [2025-01-09 14:52:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:38,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 575 [2025-01-09 14:52:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:38,413 INFO L225 Difference]: With dead ends: 427575 [2025-01-09 14:52:38,414 INFO L226 Difference]: Without dead ends: 222607 [2025-01-09 14:52:38,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:52:38,557 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 712 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:38,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1849 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:52:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222607 states. [2025-01-09 14:52:42,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222607 to 211419. [2025-01-09 14:52:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211419 states, 204200 states have (on average 1.6015572967678746) internal successors, (327038), 204296 states have internal predecessors, (327038), 6992 states have call successors, (6992), 226 states have call predecessors, (6992), 226 states have return successors, (6992), 6896 states have call predecessors, (6992), 6992 states have call successors, (6992) [2025-01-09 14:52:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211419 states to 211419 states and 341022 transitions. [2025-01-09 14:52:43,617 INFO L78 Accepts]: Start accepts. Automaton has 211419 states and 341022 transitions. Word has length 575 [2025-01-09 14:52:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:43,618 INFO L471 AbstractCegarLoop]: Abstraction has 211419 states and 341022 transitions. [2025-01-09 14:52:43,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 211419 states and 341022 transitions. [2025-01-09 14:52:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-01-09 14:52:43,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:43,646 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:43,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:52:43,647 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:43,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash -918502157, now seen corresponding path program 1 times [2025-01-09 14:52:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:43,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293829193] [2025-01-09 14:52:43,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:43,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:43,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-01-09 14:52:44,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-01-09 14:52:44,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:44,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:44,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:44,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293829193] [2025-01-09 14:52:44,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293829193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:44,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:44,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621526800] [2025-01-09 14:52:44,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:44,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:44,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:44,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:44,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:44,764 INFO L87 Difference]: Start difference. First operand 211419 states and 341022 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:48,506 INFO L93 Difference]: Finished difference Result 635793 states and 1026699 transitions. [2025-01-09 14:52:48,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:52:48,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 575 [2025-01-09 14:52:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:49,222 INFO L225 Difference]: With dead ends: 635793 [2025-01-09 14:52:49,222 INFO L226 Difference]: Without dead ends: 424611 [2025-01-09 14:52:49,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:49,402 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 596 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:49,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 1952 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:52:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424611 states. [2025-01-09 14:52:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424611 to 360529. [2025-01-09 14:52:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360529 states, 350301 states have (on average 1.5982226713597734) internal successors, (559859), 350525 states have internal predecessors, (559859), 9808 states have call successors, (9808), 419 states have call predecessors, (9808), 419 states have return successors, (9808), 9584 states have call predecessors, (9808), 9808 states have call successors, (9808) [2025-01-09 14:52:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360529 states to 360529 states and 579475 transitions. [2025-01-09 14:52:57,436 INFO L78 Accepts]: Start accepts. Automaton has 360529 states and 579475 transitions. Word has length 575 [2025-01-09 14:52:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:57,437 INFO L471 AbstractCegarLoop]: Abstraction has 360529 states and 579475 transitions. [2025-01-09 14:52:57,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 14:52:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 360529 states and 579475 transitions. [2025-01-09 14:52:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-01-09 14:52:57,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:57,512 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:57,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:52:57,512 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:57,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:57,513 INFO L85 PathProgramCache]: Analyzing trace with hash -956067851, now seen corresponding path program 1 times [2025-01-09 14:52:57,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:57,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118241610] [2025-01-09 14:52:57,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:57,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:57,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-01-09 14:52:57,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-01-09 14:52:57,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:57,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-01-09 14:52:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118241610] [2025-01-09 14:52:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118241610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:58,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:58,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:52:58,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256655719] [2025-01-09 14:52:58,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:58,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:52:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:58,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:52:58,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:52:58,220 INFO L87 Difference]: Start difference. First operand 360529 states and 579475 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80)