./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-39.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-39.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 e816ebcf30f2d29dec7c2f2805587c40ad591ee9556f47b4bacdfa3908977d3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:46:20,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:46:20,419 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:46:20,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:46:20,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:46:20,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:46:20,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:46:20,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:46:20,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:46:20,438 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:46:20,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:46:20,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:46:20,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:46:20,439 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:46:20,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:20,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:46:20,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:20,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:46:20,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:46:20,441 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:46:20,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:46:20,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:46:20,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:46:20,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:46:20,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:46:20,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:46:20,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:46:20,441 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 -> e816ebcf30f2d29dec7c2f2805587c40ad591ee9556f47b4bacdfa3908977d3e [2025-01-09 14:46:20,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:46:20,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:46:20,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:46:20,714 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:46:20,714 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:46:20,715 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-39.i [2025-01-09 14:46:21,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/828c589c4/de1569aa9d3b46848e1808cbe984f243/FLAG04dc0af7f [2025-01-09 14:46:22,185 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:46:22,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-39.i [2025-01-09 14:46:22,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/828c589c4/de1569aa9d3b46848e1808cbe984f243/FLAG04dc0af7f [2025-01-09 14:46:22,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/828c589c4/de1569aa9d3b46848e1808cbe984f243 [2025-01-09 14:46:22,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:46:22,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:46:22,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:46:22,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:46:22,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:46:22,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:22,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22, skipping insertion in model container [2025-01-09 14:46:22,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:22,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:46:22,544 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-39.i[916,929] [2025-01-09 14:46:22,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:46:22,776 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:46:22,784 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-39.i[916,929] [2025-01-09 14:46:22,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:46:22,910 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:46:22,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22 WrapperNode [2025-01-09 14:46:22,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:46:22,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:46:22,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:46:22,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:46:22,918 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:46:22" (1/1) ... [2025-01-09 14:46:22,941 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:46:22" (1/1) ... [2025-01-09 14:46:23,019 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 838 [2025-01-09 14:46:23,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:46:23,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:46:23,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:46:23,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:46:23,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,128 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:46:23,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:46:23,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:46:23,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:46:23,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:46:23,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (1/1) ... [2025-01-09 14:46:23,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:46:23,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:23,244 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:46:23,246 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:46:23,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:46:23,266 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:46:23,266 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:46:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:46:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:46:23,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:46:23,395 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:46:23,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:46:24,461 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-01-09 14:46:24,461 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:46:24,484 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:46:24,484 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:46:24,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:46:24 BoogieIcfgContainer [2025-01-09 14:46:24,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:46:24,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:46:24,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:46:24,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:46:24,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:46:22" (1/3) ... [2025-01-09 14:46:24,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56da88a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:46:24, skipping insertion in model container [2025-01-09 14:46:24,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:46:22" (2/3) ... [2025-01-09 14:46:24,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56da88a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:46:24, skipping insertion in model container [2025-01-09 14:46:24,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:46:24" (3/3) ... [2025-01-09 14:46:24,492 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-39.i [2025-01-09 14:46:24,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:46:24,504 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-39.i that has 2 procedures, 320 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:46:24,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:46:24,568 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;@355c578e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:46:24,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:46:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 255 states have (on average 1.5254901960784313) internal successors, (389), 256 states have internal predecessors, (389), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:46:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 14:46:24,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:24,593 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:24,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:24,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:24,598 INFO L85 PathProgramCache]: Analyzing trace with hash 117121180, now seen corresponding path program 1 times [2025-01-09 14:46:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:24,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729939623] [2025-01-09 14:46:24,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:24,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:24,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 14:46:24,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 14:46:24,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:24,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-01-09 14:46:25,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:25,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729939623] [2025-01-09 14:46:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729939623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:46:25,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178933565] [2025-01-09 14:46:25,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:25,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:46:25,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:46:25,201 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:46:25,203 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:46:25,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 14:46:25,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 14:46:25,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:25,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:25,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:46:25,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-01-09 14:46:25,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:46:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178933565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:25,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:46:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:46:25,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763939727] [2025-01-09 14:46:25,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:25,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:46:25,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:25,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:46:25,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:46:25,610 INFO L87 Difference]: Start difference. First operand has 320 states, 255 states have (on average 1.5254901960784313) internal successors, (389), 256 states have internal predecessors, (389), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:46:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:25,672 INFO L93 Difference]: Finished difference Result 634 states and 1083 transitions. [2025-01-09 14:46:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:46:25,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) Word has length 458 [2025-01-09 14:46:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:25,683 INFO L225 Difference]: With dead ends: 634 [2025-01-09 14:46:25,683 INFO L226 Difference]: Without dead ends: 317 [2025-01-09 14:46:25,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 459 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:46:25,692 INFO L435 NwaCegarLoop]: 508 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, 508 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:46:25,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-01-09 14:46:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2025-01-09 14:46:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 253 states have (on average 1.517786561264822) internal successors, (384), 253 states have internal predecessors, (384), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:46:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 508 transitions. [2025-01-09 14:46:25,743 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 508 transitions. Word has length 458 [2025-01-09 14:46:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:25,744 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 508 transitions. [2025-01-09 14:46:25,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:46:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 508 transitions. [2025-01-09 14:46:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 14:46:25,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:25,756 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:25,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:46:25,958 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:46:25,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:25,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:25,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1962756696, now seen corresponding path program 1 times [2025-01-09 14:46:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:25,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915392697] [2025-01-09 14:46:25,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:25,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:26,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 14:46:26,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 14:46:26,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:26,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:26,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:26,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915392697] [2025-01-09 14:46:26,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915392697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:26,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:26,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:26,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615172985] [2025-01-09 14:46:26,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:26,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:26,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:26,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:26,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:26,473 INFO L87 Difference]: Start difference. First operand 317 states and 508 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:26,565 INFO L93 Difference]: Finished difference Result 942 states and 1512 transitions. [2025-01-09 14:46:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 458 [2025-01-09 14:46:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:26,574 INFO L225 Difference]: With dead ends: 942 [2025-01-09 14:46:26,574 INFO L226 Difference]: Without dead ends: 628 [2025-01-09 14:46:26,575 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:46:26,575 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 452 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:26,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 989 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-01-09 14:46:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2025-01-09 14:46:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 499 states have (on average 1.5130260521042085) internal successors, (755), 499 states have internal predecessors, (755), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 14:46:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1003 transitions. [2025-01-09 14:46:26,635 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1003 transitions. Word has length 458 [2025-01-09 14:46:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:26,636 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 1003 transitions. [2025-01-09 14:46:26,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1003 transitions. [2025-01-09 14:46:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 14:46:26,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:26,641 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:46:26,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash 510426335, now seen corresponding path program 1 times [2025-01-09 14:46:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:26,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972024602] [2025-01-09 14:46:26,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:26,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:46:26,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:46:26,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:26,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:27,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972024602] [2025-01-09 14:46:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972024602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:27,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:27,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:27,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129024955] [2025-01-09 14:46:27,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:27,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:27,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:27,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:27,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:27,466 INFO L87 Difference]: Start difference. First operand 626 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:27,528 INFO L93 Difference]: Finished difference Result 1429 states and 2294 transitions. [2025-01-09 14:46:27,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:27,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 459 [2025-01-09 14:46:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:27,535 INFO L225 Difference]: With dead ends: 1429 [2025-01-09 14:46:27,535 INFO L226 Difference]: Without dead ends: 806 [2025-01-09 14:46:27,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:46:27,537 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 488 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:27,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 989 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-01-09 14:46:27,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 626. [2025-01-09 14:46:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 499 states have (on average 1.5090180360721444) internal successors, (753), 499 states have internal predecessors, (753), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 14:46:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1001 transitions. [2025-01-09 14:46:27,582 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1001 transitions. Word has length 459 [2025-01-09 14:46:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:27,583 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 1001 transitions. [2025-01-09 14:46:27,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1001 transitions. [2025-01-09 14:46:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 14:46:27,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:27,588 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:27,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:46:27,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:27,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1242393761, now seen corresponding path program 1 times [2025-01-09 14:46:27,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:27,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473954936] [2025-01-09 14:46:27,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:27,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:46:28,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:46:28,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:28,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:28,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:28,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473954936] [2025-01-09 14:46:28,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473954936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:28,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:28,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:28,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601798296] [2025-01-09 14:46:28,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:28,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:28,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:28,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:28,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:28,934 INFO L87 Difference]: Start difference. First operand 626 states and 1001 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:29,382 INFO L93 Difference]: Finished difference Result 1754 states and 2806 transitions. [2025-01-09 14:46:29,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 459 [2025-01-09 14:46:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:29,389 INFO L225 Difference]: With dead ends: 1754 [2025-01-09 14:46:29,389 INFO L226 Difference]: Without dead ends: 1131 [2025-01-09 14:46:29,391 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:46:29,392 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 446 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:29,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1462 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:46:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2025-01-09 14:46:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 754. [2025-01-09 14:46:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 564 states have (on average 1.4769503546099292) internal successors, (833), 564 states have internal predecessors, (833), 186 states have call successors, (186), 3 states have call predecessors, (186), 3 states have return successors, (186), 186 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 14:46:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1205 transitions. [2025-01-09 14:46:29,487 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1205 transitions. Word has length 459 [2025-01-09 14:46:29,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:29,488 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1205 transitions. [2025-01-09 14:46:29,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:29,488 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1205 transitions. [2025-01-09 14:46:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-09 14:46:29,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:29,501 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:29,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:46:29,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:29,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash -664009505, now seen corresponding path program 1 times [2025-01-09 14:46:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:29,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594818182] [2025-01-09 14:46:29,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:29,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-09 14:46:30,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-09 14:46:30,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:30,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:30,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:30,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594818182] [2025-01-09 14:46:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594818182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:30,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:30,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:30,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198401183] [2025-01-09 14:46:30,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:30,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:30,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:30,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:30,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:30,634 INFO L87 Difference]: Start difference. First operand 754 states and 1205 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:31,075 INFO L93 Difference]: Finished difference Result 2180 states and 3474 transitions. [2025-01-09 14:46:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:31,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 459 [2025-01-09 14:46:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:31,084 INFO L225 Difference]: With dead ends: 2180 [2025-01-09 14:46:31,085 INFO L226 Difference]: Without dead ends: 1557 [2025-01-09 14:46:31,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:46:31,088 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 838 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:31,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1816 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:31,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-01-09 14:46:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1375. [2025-01-09 14:46:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1059 states have (on average 1.4919735599622286) internal successors, (1580), 1059 states have internal predecessors, (1580), 310 states have call successors, (310), 5 states have call predecessors, (310), 5 states have return successors, (310), 310 states have call predecessors, (310), 310 states have call successors, (310) [2025-01-09 14:46:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2200 transitions. [2025-01-09 14:46:31,205 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2200 transitions. Word has length 459 [2025-01-09 14:46:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:31,208 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 2200 transitions. [2025-01-09 14:46:31,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2200 transitions. [2025-01-09 14:46:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-01-09 14:46:31,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:31,216 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:31,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:46:31,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:31,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:31,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1067451464, now seen corresponding path program 1 times [2025-01-09 14:46:31,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:31,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385633269] [2025-01-09 14:46:31,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:31,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:31,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 14:46:31,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 14:46:31,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:31,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:31,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:31,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385633269] [2025-01-09 14:46:31,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385633269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:31,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:31,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:31,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688730991] [2025-01-09 14:46:31,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:31,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:31,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:31,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:31,893 INFO L87 Difference]: Start difference. First operand 1375 states and 2200 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:32,418 INFO L93 Difference]: Finished difference Result 4131 states and 6579 transitions. [2025-01-09 14:46:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:32,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 460 [2025-01-09 14:46:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:32,434 INFO L225 Difference]: With dead ends: 4131 [2025-01-09 14:46:32,434 INFO L226 Difference]: Without dead ends: 2887 [2025-01-09 14:46:32,438 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:46:32,440 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 671 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:32,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1590 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:46:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2025-01-09 14:46:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2655. [2025-01-09 14:46:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2087 states have (on average 1.4949688548155247) internal successors, (3120), 2087 states have internal predecessors, (3120), 558 states have call successors, (558), 9 states have call predecessors, (558), 9 states have return successors, (558), 558 states have call predecessors, (558), 558 states have call successors, (558) [2025-01-09 14:46:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4236 transitions. [2025-01-09 14:46:32,623 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4236 transitions. Word has length 460 [2025-01-09 14:46:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:32,624 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 4236 transitions. [2025-01-09 14:46:32,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4236 transitions. [2025-01-09 14:46:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-01-09 14:46:32,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:32,631 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:32,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:46:32,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:32,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash 348877370, now seen corresponding path program 1 times [2025-01-09 14:46:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048524683] [2025-01-09 14:46:32,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:32,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-09 14:46:32,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 14:46:32,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:32,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:33,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:33,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048524683] [2025-01-09 14:46:33,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048524683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:33,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:33,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:33,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469584736] [2025-01-09 14:46:33,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:33,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:33,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:33,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:33,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:33,422 INFO L87 Difference]: Start difference. First operand 2655 states and 4236 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:33,561 INFO L93 Difference]: Finished difference Result 5195 states and 8287 transitions. [2025-01-09 14:46:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:33,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 461 [2025-01-09 14:46:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:33,580 INFO L225 Difference]: With dead ends: 5195 [2025-01-09 14:46:33,581 INFO L226 Difference]: Without dead ends: 2671 [2025-01-09 14:46:33,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:33,587 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 0 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:33,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2005 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:46:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2025-01-09 14:46:33,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2671. [2025-01-09 14:46:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 2103 states have (on average 1.4902520209224916) internal successors, (3134), 2103 states have internal predecessors, (3134), 558 states have call successors, (558), 9 states have call predecessors, (558), 9 states have return successors, (558), 558 states have call predecessors, (558), 558 states have call successors, (558) [2025-01-09 14:46:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 4250 transitions. [2025-01-09 14:46:33,783 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 4250 transitions. Word has length 461 [2025-01-09 14:46:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:33,783 INFO L471 AbstractCegarLoop]: Abstraction has 2671 states and 4250 transitions. [2025-01-09 14:46:33,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 4250 transitions. [2025-01-09 14:46:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 14:46:33,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:33,790 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:33,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:46:33,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:33,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash -96649014, now seen corresponding path program 1 times [2025-01-09 14:46:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:33,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562575541] [2025-01-09 14:46:33,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:33,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 14:46:34,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 14:46:34,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:34,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:35,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:35,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562575541] [2025-01-09 14:46:35,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562575541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:35,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:35,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:46:35,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948670344] [2025-01-09 14:46:35,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:35,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:46:35,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:35,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:46:35,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:46:35,025 INFO L87 Difference]: Start difference. First operand 2671 states and 4250 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:46:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:35,993 INFO L93 Difference]: Finished difference Result 5805 states and 9225 transitions. [2025-01-09 14:46:35,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:46:35,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 463 [2025-01-09 14:46:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:36,021 INFO L225 Difference]: With dead ends: 5805 [2025-01-09 14:46:36,022 INFO L226 Difference]: Without dead ends: 3265 [2025-01-09 14:46:36,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:46:36,028 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1603 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:36,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 1498 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:46:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2025-01-09 14:46:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 2873. [2025-01-09 14:46:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2305 states have (on average 1.506290672451193) internal successors, (3472), 2305 states have internal predecessors, (3472), 558 states have call successors, (558), 9 states have call predecessors, (558), 9 states have return successors, (558), 558 states have call predecessors, (558), 558 states have call successors, (558) [2025-01-09 14:46:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 4588 transitions. [2025-01-09 14:46:36,181 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 4588 transitions. Word has length 463 [2025-01-09 14:46:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:36,183 INFO L471 AbstractCegarLoop]: Abstraction has 2873 states and 4588 transitions. [2025-01-09 14:46:36,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:46:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 4588 transitions. [2025-01-09 14:46:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 14:46:36,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:36,187 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:36,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:46:36,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:36,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash 178110600, now seen corresponding path program 1 times [2025-01-09 14:46:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:36,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329352825] [2025-01-09 14:46:36,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:36,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 14:46:36,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 14:46:36,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:36,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:37,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329352825] [2025-01-09 14:46:37,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329352825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:37,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:37,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561215853] [2025-01-09 14:46:37,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:37,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:37,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:37,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:37,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:37,078 INFO L87 Difference]: Start difference. First operand 2873 states and 4588 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:37,560 INFO L93 Difference]: Finished difference Result 9352 states and 14857 transitions. [2025-01-09 14:46:37,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-01-09 14:46:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:37,593 INFO L225 Difference]: With dead ends: 9352 [2025-01-09 14:46:37,593 INFO L226 Difference]: Without dead ends: 6610 [2025-01-09 14:46:37,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:46:37,604 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 665 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:37,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 2150 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:46:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6610 states. [2025-01-09 14:46:37,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6610 to 5454. [2025-01-09 14:46:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5454 states, 4717 states have (on average 1.5395378418486325) internal successors, (7262), 4725 states have internal predecessors, (7262), 718 states have call successors, (718), 18 states have call predecessors, (718), 18 states have return successors, (718), 710 states have call predecessors, (718), 718 states have call successors, (718) [2025-01-09 14:46:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5454 states to 5454 states and 8698 transitions. [2025-01-09 14:46:37,954 INFO L78 Accepts]: Start accepts. Automaton has 5454 states and 8698 transitions. Word has length 463 [2025-01-09 14:46:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:37,956 INFO L471 AbstractCegarLoop]: Abstraction has 5454 states and 8698 transitions. [2025-01-09 14:46:37,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 5454 states and 8698 transitions. [2025-01-09 14:46:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 14:46:37,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:37,961 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:37,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:46:37,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:37,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:37,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1780464186, now seen corresponding path program 1 times [2025-01-09 14:46:37,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:37,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49154753] [2025-01-09 14:46:37,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:37,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:37,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 14:46:38,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 14:46:38,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:38,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:38,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:38,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49154753] [2025-01-09 14:46:38,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49154753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:38,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:38,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:46:38,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980040391] [2025-01-09 14:46:38,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:38,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:46:38,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:38,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:46:38,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:46:38,755 INFO L87 Difference]: Start difference. First operand 5454 states and 8698 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:39,275 INFO L93 Difference]: Finished difference Result 13814 states and 21929 transitions. [2025-01-09 14:46:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:46:39,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-01-09 14:46:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:39,326 INFO L225 Difference]: With dead ends: 13814 [2025-01-09 14:46:39,326 INFO L226 Difference]: Without dead ends: 8495 [2025-01-09 14:46:39,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:46:39,342 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 907 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:39,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1380 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:46:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8495 states. [2025-01-09 14:46:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8495 to 5531. [2025-01-09 14:46:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5531 states, 4794 states have (on average 1.5371297455152273) internal successors, (7369), 4802 states have internal predecessors, (7369), 718 states have call successors, (718), 18 states have call predecessors, (718), 18 states have return successors, (718), 710 states have call predecessors, (718), 718 states have call successors, (718) [2025-01-09 14:46:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 8805 transitions. [2025-01-09 14:46:39,604 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 8805 transitions. Word has length 463 [2025-01-09 14:46:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:39,606 INFO L471 AbstractCegarLoop]: Abstraction has 5531 states and 8805 transitions. [2025-01-09 14:46:39,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 8805 transitions. [2025-01-09 14:46:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 14:46:39,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:39,611 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:39,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:46:39,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:39,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1207360712, now seen corresponding path program 1 times [2025-01-09 14:46:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:39,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813246957] [2025-01-09 14:46:39,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:39,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 14:46:39,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 14:46:39,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:39,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:40,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:40,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813246957] [2025-01-09 14:46:40,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813246957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:40,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:40,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:46:40,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131831978] [2025-01-09 14:46:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:40,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:46:40,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:40,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:46:40,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:46:40,265 INFO L87 Difference]: Start difference. First operand 5531 states and 8805 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:41,265 INFO L93 Difference]: Finished difference Result 17456 states and 27823 transitions. [2025-01-09 14:46:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:46:41,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-01-09 14:46:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:41,295 INFO L225 Difference]: With dead ends: 17456 [2025-01-09 14:46:41,296 INFO L226 Difference]: Without dead ends: 12060 [2025-01-09 14:46:41,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:46:41,311 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 1441 mSDsluCounter, 2007 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:41,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 2643 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:46:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12060 states. [2025-01-09 14:46:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12060 to 11642. [2025-01-09 14:46:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11642 states, 10569 states have (on average 1.5646702620872364) internal successors, (16537), 10581 states have internal predecessors, (16537), 1046 states have call successors, (1046), 26 states have call predecessors, (1046), 26 states have return successors, (1046), 1034 states have call predecessors, (1046), 1046 states have call successors, (1046) [2025-01-09 14:46:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11642 states to 11642 states and 18629 transitions. [2025-01-09 14:46:41,752 INFO L78 Accepts]: Start accepts. Automaton has 11642 states and 18629 transitions. Word has length 463 [2025-01-09 14:46:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:41,753 INFO L471 AbstractCegarLoop]: Abstraction has 11642 states and 18629 transitions. [2025-01-09 14:46:41,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 11642 states and 18629 transitions. [2025-01-09 14:46:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 14:46:41,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:41,762 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:46:41,762 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash 180916831, now seen corresponding path program 1 times [2025-01-09 14:46:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:41,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076952400] [2025-01-09 14:46:41,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:41,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 14:46:41,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 14:46:41,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:41,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:42,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:42,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076952400] [2025-01-09 14:46:42,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076952400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:42,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:42,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:46:42,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89682404] [2025-01-09 14:46:42,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:42,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:46:42,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:42,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:46:42,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:42,306 INFO L87 Difference]: Start difference. First operand 11642 states and 18629 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:43,330 INFO L93 Difference]: Finished difference Result 34914 states and 55603 transitions. [2025-01-09 14:46:43,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:46:43,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-01-09 14:46:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:43,384 INFO L225 Difference]: With dead ends: 34914 [2025-01-09 14:46:43,385 INFO L226 Difference]: Without dead ends: 22170 [2025-01-09 14:46:43,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:46:43,411 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 1202 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:43,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 2396 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:46:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22170 states. [2025-01-09 14:46:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22170 to 17412. [2025-01-09 14:46:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17412 states, 16073 states have (on average 1.5638026504075158) internal successors, (25135), 16099 states have internal predecessors, (25135), 1298 states have call successors, (1298), 40 states have call predecessors, (1298), 40 states have return successors, (1298), 1272 states have call predecessors, (1298), 1298 states have call successors, (1298) [2025-01-09 14:46:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 27731 transitions. [2025-01-09 14:46:44,175 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 27731 transitions. Word has length 463 [2025-01-09 14:46:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:44,175 INFO L471 AbstractCegarLoop]: Abstraction has 17412 states and 27731 transitions. [2025-01-09 14:46:44,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 27731 transitions. [2025-01-09 14:46:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 14:46:44,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:44,188 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:44,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:46:44,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:44,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2057399649, now seen corresponding path program 1 times [2025-01-09 14:46:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561610777] [2025-01-09 14:46:44,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:44,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:44,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 14:46:44,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 14:46:44,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:44,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:44,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561610777] [2025-01-09 14:46:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561610777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:44,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:44,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:46:44,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354592515] [2025-01-09 14:46:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:44,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:46:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:44,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:46:44,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:46:44,733 INFO L87 Difference]: Start difference. First operand 17412 states and 27731 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:46:45,278 INFO L93 Difference]: Finished difference Result 45115 states and 71911 transitions. [2025-01-09 14:46:45,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:46:45,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-01-09 14:46:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:46:45,341 INFO L225 Difference]: With dead ends: 45115 [2025-01-09 14:46:45,342 INFO L226 Difference]: Without dead ends: 27831 [2025-01-09 14:46:45,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:46:45,363 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 389 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:46:45,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1297 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:46:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27831 states. [2025-01-09 14:46:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27831 to 27759. [2025-01-09 14:46:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27759 states, 25634 states have (on average 1.5638995084653196) internal successors, (40089), 25674 states have internal predecessors, (40089), 2062 states have call successors, (2062), 62 states have call predecessors, (2062), 62 states have return successors, (2062), 2022 states have call predecessors, (2062), 2062 states have call successors, (2062) [2025-01-09 14:46:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27759 states to 27759 states and 44213 transitions. [2025-01-09 14:46:46,092 INFO L78 Accepts]: Start accepts. Automaton has 27759 states and 44213 transitions. Word has length 463 [2025-01-09 14:46:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:46:46,092 INFO L471 AbstractCegarLoop]: Abstraction has 27759 states and 44213 transitions. [2025-01-09 14:46:46,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-01-09 14:46:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 27759 states and 44213 transitions. [2025-01-09 14:46:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-01-09 14:46:46,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:46:46,102 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:46,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:46:46,103 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:46:46,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:46:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1604714674, now seen corresponding path program 1 times [2025-01-09 14:46:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:46:46,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071495193] [2025-01-09 14:46:46,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:46:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:46:46,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 14:46:46,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 14:46:46,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:46:46,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:46:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:46:52,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:46:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071495193] [2025-01-09 14:46:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071495193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:46:52,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:46:52,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 14:46:52,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229913669] [2025-01-09 14:46:52,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:46:52,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 14:46:52,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:52,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 14:46:52,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:46:52,144 INFO L87 Difference]: Start difference. First operand 27759 states and 44213 transitions. Second operand has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:47:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:00,928 INFO L93 Difference]: Finished difference Result 122152 states and 194206 transitions. [2025-01-09 14:47:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 14:47:00,928 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 464 [2025-01-09 14:47:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:01,094 INFO L225 Difference]: With dead ends: 122152 [2025-01-09 14:47:01,094 INFO L226 Difference]: Without dead ends: 94549 [2025-01-09 14:47:01,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 14:47:01,129 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 6134 mSDsluCounter, 7140 mSDsCounter, 0 mSdLazyCounter, 5208 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6134 SdHoareTripleChecker+Valid, 7855 SdHoareTripleChecker+Invalid, 5247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 5208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:01,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6134 Valid, 7855 Invalid, 5247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 5208 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 14:47:01,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94549 states. [2025-01-09 14:47:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94549 to 34158. [2025-01-09 14:47:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34158 states, 32020 states have (on average 1.57473454091193) internal successors, (50423), 32060 states have internal predecessors, (50423), 2062 states have call successors, (2062), 75 states have call predecessors, (2062), 75 states have return successors, (2062), 2022 states have call predecessors, (2062), 2062 states have call successors, (2062) [2025-01-09 14:47:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34158 states to 34158 states and 54547 transitions. [2025-01-09 14:47:02,172 INFO L78 Accepts]: Start accepts. Automaton has 34158 states and 54547 transitions. Word has length 464 [2025-01-09 14:47:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:02,172 INFO L471 AbstractCegarLoop]: Abstraction has 34158 states and 54547 transitions. [2025-01-09 14:47:02,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.722222222222221) internal successors, (157), 18 states have internal predecessors, (157), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:47:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 34158 states and 54547 transitions. [2025-01-09 14:47:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-01-09 14:47:02,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:02,184 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:02,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:47:02,184 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:02,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:02,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1933867186, now seen corresponding path program 1 times [2025-01-09 14:47:02,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:02,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491941255] [2025-01-09 14:47:02,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:02,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 14:47:04,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 14:47:04,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:04,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:47:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491941255] [2025-01-09 14:47:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491941255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:06,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 14:47:06,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578755699] [2025-01-09 14:47:06,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:06,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:47:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:06,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:47:06,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:47:06,014 INFO L87 Difference]: Start difference. First operand 34158 states and 54547 transitions. Second operand has 13 states, 13 states have (on average 12.076923076923077) internal successors, (157), 13 states have internal predecessors, (157), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:47:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:09,340 INFO L93 Difference]: Finished difference Result 110165 states and 175768 transitions. [2025-01-09 14:47:09,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:47:09,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.076923076923077) internal successors, (157), 13 states have internal predecessors, (157), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 464 [2025-01-09 14:47:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:09,524 INFO L225 Difference]: With dead ends: 110165 [2025-01-09 14:47:09,524 INFO L226 Difference]: Without dead ends: 76167 [2025-01-09 14:47:09,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:47:09,578 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 4578 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 4545 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:09,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 4545 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 14:47:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76167 states. [2025-01-09 14:47:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76167 to 35399. [2025-01-09 14:47:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35399 states, 33261 states have (on average 1.5778539430564325) internal successors, (52481), 33301 states have internal predecessors, (52481), 2062 states have call successors, (2062), 75 states have call predecessors, (2062), 75 states have return successors, (2062), 2022 states have call predecessors, (2062), 2062 states have call successors, (2062) [2025-01-09 14:47:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35399 states to 35399 states and 56605 transitions. [2025-01-09 14:47:10,744 INFO L78 Accepts]: Start accepts. Automaton has 35399 states and 56605 transitions. Word has length 464 [2025-01-09 14:47:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:10,744 INFO L471 AbstractCegarLoop]: Abstraction has 35399 states and 56605 transitions. [2025-01-09 14:47:10,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.076923076923077) internal successors, (157), 13 states have internal predecessors, (157), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:47:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 35399 states and 56605 transitions. [2025-01-09 14:47:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-01-09 14:47:10,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:10,755 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:47:10,755 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:10,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1324203350, now seen corresponding path program 1 times [2025-01-09 14:47:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:10,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624730480] [2025-01-09 14:47:10,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:10,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 14:47:11,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 14:47:11,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:11,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-01-09 14:47:11,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624730480] [2025-01-09 14:47:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624730480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:47:11,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:47:11,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:47:11,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118408125] [2025-01-09 14:47:11,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:47:11,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:47:11,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:11,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:47:11,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:47:11,547 INFO L87 Difference]: Start difference. First operand 35399 states and 56605 transitions. Second operand has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:47:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:13,331 INFO L93 Difference]: Finished difference Result 88420 states and 141341 transitions. [2025-01-09 14:47:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:47:13,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 464 [2025-01-09 14:47:13,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:13,433 INFO L225 Difference]: With dead ends: 88420 [2025-01-09 14:47:13,433 INFO L226 Difference]: Without dead ends: 65082 [2025-01-09 14:47:13,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:47:13,465 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 2219 mSDsluCounter, 3667 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 4345 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:13,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2219 Valid, 4345 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:47:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65082 states. [2025-01-09 14:47:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65082 to 40279. [2025-01-09 14:47:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40279 states, 38106 states have (on average 1.5865742927622946) internal successors, (60458), 38146 states have internal predecessors, (60458), 2062 states have call successors, (2062), 110 states have call predecessors, (2062), 110 states have return successors, (2062), 2022 states have call predecessors, (2062), 2062 states have call successors, (2062) [2025-01-09 14:47:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40279 states to 40279 states and 64582 transitions. [2025-01-09 14:47:14,881 INFO L78 Accepts]: Start accepts. Automaton has 40279 states and 64582 transitions. Word has length 464 [2025-01-09 14:47:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:14,882 INFO L471 AbstractCegarLoop]: Abstraction has 40279 states and 64582 transitions. [2025-01-09 14:47:14,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-01-09 14:47:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 40279 states and 64582 transitions. [2025-01-09 14:47:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-01-09 14:47:14,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:14,895 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:14,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:47:14,896 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:14,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2016823788, now seen corresponding path program 1 times [2025-01-09 14:47:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:14,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437536116] [2025-01-09 14:47:14,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:14,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 14:47:16,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 14:47:16,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:16,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-01-09 14:47:17,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:17,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437536116] [2025-01-09 14:47:17,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437536116] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:17,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892404355] [2025-01-09 14:47:17,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:17,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:17,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:17,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:47:17,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:47:17,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 14:47:17,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 14:47:17,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:17,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:17,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 14:47:17,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 61 proven. 183 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 14:47:20,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:23,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892404355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:23,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:47:23,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2025-01-09 14:47:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728762541] [2025-01-09 14:47:23,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:23,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 14:47:23,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:23,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 14:47:23,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 14:47:23,714 INFO L87 Difference]: Start difference. First operand 40279 states and 64582 transitions. Second operand has 28 states, 28 states have (on average 10.464285714285714) internal successors, (293), 28 states have internal predecessors, (293), 4 states have call successors, (124), 3 states have call predecessors, (124), 4 states have return successors, (124), 2 states have call predecessors, (124), 4 states have call successors, (124) [2025-01-09 14:47:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:47:26,805 INFO L93 Difference]: Finished difference Result 98232 states and 156545 transitions. [2025-01-09 14:47:26,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 14:47:26,806 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.464285714285714) internal successors, (293), 28 states have internal predecessors, (293), 4 states have call successors, (124), 3 states have call predecessors, (124), 4 states have return successors, (124), 2 states have call predecessors, (124), 4 states have call successors, (124) Word has length 464 [2025-01-09 14:47:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:47:26,918 INFO L225 Difference]: With dead ends: 98232 [2025-01-09 14:47:26,918 INFO L226 Difference]: Without dead ends: 58117 [2025-01-09 14:47:26,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 945 GetRequests, 896 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=459, Invalid=2091, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 14:47:26,973 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 5112 mSDsluCounter, 4547 mSDsCounter, 0 mSdLazyCounter, 2998 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5112 SdHoareTripleChecker+Valid, 4975 SdHoareTripleChecker+Invalid, 3030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:47:26,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5112 Valid, 4975 Invalid, 3030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2998 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 14:47:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58117 states. [2025-01-09 14:47:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58117 to 41046. [2025-01-09 14:47:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41046 states, 38838 states have (on average 1.5855862814769042) internal successors, (61581), 38878 states have internal predecessors, (61581), 2062 states have call successors, (2062), 145 states have call predecessors, (2062), 145 states have return successors, (2062), 2022 states have call predecessors, (2062), 2062 states have call successors, (2062) [2025-01-09 14:47:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41046 states to 41046 states and 65705 transitions. [2025-01-09 14:47:28,012 INFO L78 Accepts]: Start accepts. Automaton has 41046 states and 65705 transitions. Word has length 464 [2025-01-09 14:47:28,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:47:28,013 INFO L471 AbstractCegarLoop]: Abstraction has 41046 states and 65705 transitions. [2025-01-09 14:47:28,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.464285714285714) internal successors, (293), 28 states have internal predecessors, (293), 4 states have call successors, (124), 3 states have call predecessors, (124), 4 states have return successors, (124), 2 states have call predecessors, (124), 4 states have call successors, (124) [2025-01-09 14:47:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 41046 states and 65705 transitions. [2025-01-09 14:47:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-01-09 14:47:28,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:47:28,023 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:28,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:47:28,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 14:47:28,224 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:47:28,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:47:28,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1948990996, now seen corresponding path program 1 times [2025-01-09 14:47:28,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:47:28,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425650191] [2025-01-09 14:47:28,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:28,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:47:28,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 14:47:29,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 14:47:29,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:29,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 21 proven. 162 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-01-09 14:47:31,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:47:31,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425650191] [2025-01-09 14:47:31,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425650191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:47:31,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266892959] [2025-01-09 14:47:31,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:47:31,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:47:31,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:47:31,119 INFO L229 MonitoredProcess]: Starting monitored process 4 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:47:31,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:47:31,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 14:47:31,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 14:47:31,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:47:31,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:47:31,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:47:31,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:47:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 4722 proven. 225 refuted. 0 times theorem prover too weak. 2617 trivial. 0 not checked. [2025-01-09 14:47:32,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:47:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 135 proven. 228 refuted. 0 times theorem prover too weak. 7201 trivial. 0 not checked. [2025-01-09 14:47:32,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266892959] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:47:32,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:47:32,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-01-09 14:47:32,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590159219] [2025-01-09 14:47:32,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:47:32,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 14:47:32,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:47:32,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 14:47:32,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:47:32,935 INFO L87 Difference]: Start difference. First operand 41046 states and 65705 transitions. Second operand has 23 states, 23 states have (on average 16.47826086956522) internal successors, (379), 23 states have internal predecessors, (379), 9 states have call successors, (184), 4 states have call predecessors, (184), 8 states have return successors, (185), 9 states have call predecessors, (185), 9 states have call successors, (185)