./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.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_amount250_file-89.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 c364d5742786a109dce2eae30e32833d89e81ae3212872a34b0b87c86d2f2db6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:29:22,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:29:22,483 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:29:22,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:29:22,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:29:22,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:29:22,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:29:22,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:29:22,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:29:22,520 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:29:22,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:29:22,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:29:22,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:29:22,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:29:22,521 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:29:22,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:29:22,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:29:22,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:29:22,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:29:22,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:29:22,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:29:22,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:29:22,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:29:22,523 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:29:22,523 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:29:22,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:29:22,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:29:22,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:29:22,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:29:22,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:29:22,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:29:22,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:29:22,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:29:22,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:29:22,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:29:22,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:29:22,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:29:22,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:29:22,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:29:22,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:29:22,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:29:22,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:29:22,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:29:22,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:29:22,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:29:22,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:29:22,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:29:22,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:29:22,526 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 -> c364d5742786a109dce2eae30e32833d89e81ae3212872a34b0b87c86d2f2db6 [2025-01-09 14:29:22,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:29:22,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:29:22,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:29:22,802 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:29:22,802 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:29:22,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.i [2025-01-09 14:29:24,017 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27afe9f55/83743c1daa884bf4a4479fa5b5af9c62/FLAGea5a003b2 [2025-01-09 14:29:24,341 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:29:24,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-89.i [2025-01-09 14:29:24,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27afe9f55/83743c1daa884bf4a4479fa5b5af9c62/FLAGea5a003b2 [2025-01-09 14:29:24,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27afe9f55/83743c1daa884bf4a4479fa5b5af9c62 [2025-01-09 14:29:24,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:29:24,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:29:24,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:29:24,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:29:24,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:29:24,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:29:24" (1/1) ... [2025-01-09 14:29:24,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaf004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:24, skipping insertion in model container [2025-01-09 14:29:24,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:29:24" (1/1) ... [2025-01-09 14:29:24,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:29:24,807 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_amount250_file-89.i[916,929] [2025-01-09 14:29:24,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:29:25,000 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:29:25,011 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_amount250_file-89.i[916,929] [2025-01-09 14:29:25,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:29:25,113 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:29:25,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25 WrapperNode [2025-01-09 14:29:25,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:29:25,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:29:25,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:29:25,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:29:25,121 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:29:25" (1/1) ... [2025-01-09 14:29:25,145 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:29:25" (1/1) ... [2025-01-09 14:29:25,215 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2025-01-09 14:29:25,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:29:25,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:29:25,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:29:25,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:29:25,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,266 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:29:25,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:29:25,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:29:25,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:29:25,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:29:25,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (1/1) ... [2025-01-09 14:29:25,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:29:25,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:25,375 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:29:25,383 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:29:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:29:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:29:25,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:29:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:29:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:29:25,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:29:25,506 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:29:25,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:29:26,416 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-01-09 14:29:26,417 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:29:26,431 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:29:26,433 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:29:26,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:29:26 BoogieIcfgContainer [2025-01-09 14:29:26,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:29:26,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:29:26,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:29:26,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:29:26,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:29:24" (1/3) ... [2025-01-09 14:29:26,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ce237b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:29:26, skipping insertion in model container [2025-01-09 14:29:26,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:25" (2/3) ... [2025-01-09 14:29:26,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ce237b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:29:26, skipping insertion in model container [2025-01-09 14:29:26,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:29:26" (3/3) ... [2025-01-09 14:29:26,442 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-89.i [2025-01-09 14:29:26,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:29:26,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-89.i that has 2 procedures, 194 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:29:26,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:29:26,529 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;@1f049fc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:29:26,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:29:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 149 states have internal predecessors, (225), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 14:29:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-09 14:29:26,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:26,561 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:26,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:26,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash 892247929, now seen corresponding path program 1 times [2025-01-09 14:29:26,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:26,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257189812] [2025-01-09 14:29:26,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:26,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-01-09 14:29:26,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-01-09 14:29:26,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:26,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:27,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257189812] [2025-01-09 14:29:27,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257189812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:27,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:27,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:29:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607320339] [2025-01-09 14:29:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:27,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:29:27,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:27,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:29:27,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:29:27,308 INFO L87 Difference]: Start difference. First operand has 194 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 149 states have internal predecessors, (225), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:27,380 INFO L93 Difference]: Finished difference Result 383 states and 662 transitions. [2025-01-09 14:29:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:29:27,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-01-09 14:29:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:27,390 INFO L225 Difference]: With dead ends: 383 [2025-01-09 14:29:27,391 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 14:29:27,395 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:29:27,400 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:27,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 603 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:29:27,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 14:29:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-01-09 14:29:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 147 states have (on average 1.5034013605442176) internal successors, (221), 147 states have internal predecessors, (221), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 14:29:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 307 transitions. [2025-01-09 14:29:27,470 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 307 transitions. Word has length 298 [2025-01-09 14:29:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:27,474 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 307 transitions. [2025-01-09 14:29:27,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:27,475 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 307 transitions. [2025-01-09 14:29:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-09 14:29:27,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:27,481 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:27,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 14:29:27,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:27,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1083831695, now seen corresponding path program 1 times [2025-01-09 14:29:27,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:27,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433827804] [2025-01-09 14:29:27,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:27,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-01-09 14:29:27,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-01-09 14:29:27,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:27,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:27,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:27,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433827804] [2025-01-09 14:29:27,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433827804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:27,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:27,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:29:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884035645] [2025-01-09 14:29:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:27,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:29:27,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:27,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:29:27,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:29:27,816 INFO L87 Difference]: Start difference. First operand 192 states and 307 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:27,919 INFO L93 Difference]: Finished difference Result 478 states and 762 transitions. [2025-01-09 14:29:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:29:27,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-01-09 14:29:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:27,927 INFO L225 Difference]: With dead ends: 478 [2025-01-09 14:29:27,929 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 14:29:27,930 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:29:27,931 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 149 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:27,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 576 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:29:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 14:29:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2025-01-09 14:29:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 234 states have (on average 1.517094017094017) internal successors, (355), 235 states have internal predecessors, (355), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 14:29:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 453 transitions. [2025-01-09 14:29:27,968 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 453 transitions. Word has length 298 [2025-01-09 14:29:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:27,970 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 453 transitions. [2025-01-09 14:29:27,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 453 transitions. [2025-01-09 14:29:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-09 14:29:27,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:27,977 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:27,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:29:27,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:27,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2113190993, now seen corresponding path program 1 times [2025-01-09 14:29:27,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:27,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006595040] [2025-01-09 14:29:27,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:27,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:28,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-01-09 14:29:28,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-01-09 14:29:28,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:28,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:28,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:28,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006595040] [2025-01-09 14:29:28,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006595040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:28,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:28,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:29:28,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919212672] [2025-01-09 14:29:28,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:28,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:29:28,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:28,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:29:28,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:29:28,275 INFO L87 Difference]: Start difference. First operand 286 states and 453 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:28,371 INFO L93 Difference]: Finished difference Result 776 states and 1225 transitions. [2025-01-09 14:29:28,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:29:28,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-01-09 14:29:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:28,378 INFO L225 Difference]: With dead ends: 776 [2025-01-09 14:29:28,380 INFO L226 Difference]: Without dead ends: 493 [2025-01-09 14:29:28,381 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:29:28,382 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 165 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:28,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 573 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:29:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-01-09 14:29:28,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 489. [2025-01-09 14:29:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 427 states have (on average 1.5269320843091334) internal successors, (652), 430 states have internal predecessors, (652), 57 states have call successors, (57), 4 states have call predecessors, (57), 4 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 14:29:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 766 transitions. [2025-01-09 14:29:28,420 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 766 transitions. Word has length 298 [2025-01-09 14:29:28,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:28,422 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 766 transitions. [2025-01-09 14:29:28,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 766 transitions. [2025-01-09 14:29:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-09 14:29:28,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:28,428 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:28,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:29:28,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:28,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash 845911837, now seen corresponding path program 1 times [2025-01-09 14:29:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:28,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506533913] [2025-01-09 14:29:28,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:28,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:28,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-01-09 14:29:28,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-01-09 14:29:28,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:28,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:28,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:28,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506533913] [2025-01-09 14:29:28,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506533913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:28,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:28,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:29:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690743366] [2025-01-09 14:29:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:28,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:29:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:28,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:29:28,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:28,867 INFO L87 Difference]: Start difference. First operand 489 states and 766 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:29,052 INFO L93 Difference]: Finished difference Result 1319 states and 2061 transitions. [2025-01-09 14:29:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:29:29,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-01-09 14:29:29,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:29,059 INFO L225 Difference]: With dead ends: 1319 [2025-01-09 14:29:29,062 INFO L226 Difference]: Without dead ends: 833 [2025-01-09 14:29:29,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:29,065 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 134 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:29,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 834 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:29:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-01-09 14:29:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 827. [2025-01-09 14:29:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 753 states have (on average 1.5232403718459495) internal successors, (1147), 760 states have internal predecessors, (1147), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 14:29:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1277 transitions. [2025-01-09 14:29:29,129 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1277 transitions. Word has length 298 [2025-01-09 14:29:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:29,130 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1277 transitions. [2025-01-09 14:29:29,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1277 transitions. [2025-01-09 14:29:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-09 14:29:29,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:29,138 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:29,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:29:29,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash 868544091, now seen corresponding path program 1 times [2025-01-09 14:29:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163116209] [2025-01-09 14:29:29,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:29,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-01-09 14:29:29,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-01-09 14:29:29,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:29,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:29,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163116209] [2025-01-09 14:29:29,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163116209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:29,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:29,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:29:29,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757502018] [2025-01-09 14:29:29,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:29,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:29:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:29,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:29:29,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:29:29,518 INFO L87 Difference]: Start difference. First operand 827 states and 1277 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:29,693 INFO L93 Difference]: Finished difference Result 2325 states and 3589 transitions. [2025-01-09 14:29:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:29:29,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 298 [2025-01-09 14:29:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:29,708 INFO L225 Difference]: With dead ends: 2325 [2025-01-09 14:29:29,709 INFO L226 Difference]: Without dead ends: 1501 [2025-01-09 14:29:29,712 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:29:29,713 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 232 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:29,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 683 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:29:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-01-09 14:29:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1223. [2025-01-09 14:29:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1149 states have (on average 1.5500435161009574) internal successors, (1781), 1156 states have internal predecessors, (1781), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 14:29:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1911 transitions. [2025-01-09 14:29:29,814 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1911 transitions. Word has length 298 [2025-01-09 14:29:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:29,815 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1911 transitions. [2025-01-09 14:29:29,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1911 transitions. [2025-01-09 14:29:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 14:29:29,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:29,824 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:29,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:29:29,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:29,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash 953869305, now seen corresponding path program 1 times [2025-01-09 14:29:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:29,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206826119] [2025-01-09 14:29:29,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:29,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:29,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 14:29:30,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 14:29:30,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:30,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:32,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206826119] [2025-01-09 14:29:32,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206826119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:32,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:32,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:29:32,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736408202] [2025-01-09 14:29:32,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:32,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:29:32,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:32,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:29:32,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:29:32,141 INFO L87 Difference]: Start difference. First operand 1223 states and 1911 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:33,214 INFO L93 Difference]: Finished difference Result 3486 states and 5444 transitions. [2025-01-09 14:29:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:29:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-01-09 14:29:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:33,227 INFO L225 Difference]: With dead ends: 3486 [2025-01-09 14:29:33,228 INFO L226 Difference]: Without dead ends: 2266 [2025-01-09 14:29:33,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:29:33,232 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 470 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:33,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1508 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:29:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2025-01-09 14:29:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 1541. [2025-01-09 14:29:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1467 states have (on average 1.5685071574642127) internal successors, (2301), 1474 states have internal predecessors, (2301), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 14:29:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2431 transitions. [2025-01-09 14:29:33,299 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2431 transitions. Word has length 299 [2025-01-09 14:29:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:33,301 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 2431 transitions. [2025-01-09 14:29:33,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2431 transitions. [2025-01-09 14:29:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-01-09 14:29:33,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:33,307 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:33,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:29:33,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:33,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2089700204, now seen corresponding path program 1 times [2025-01-09 14:29:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:33,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204789764] [2025-01-09 14:29:33,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:33,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-09 14:29:33,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-09 14:29:33,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:33,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:33,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:33,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204789764] [2025-01-09 14:29:33,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204789764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:33,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:33,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:29:33,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000021197] [2025-01-09 14:29:33,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:33,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:29:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:33,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:29:33,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:33,867 INFO L87 Difference]: Start difference. First operand 1541 states and 2431 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:34,090 INFO L93 Difference]: Finished difference Result 3101 states and 4889 transitions. [2025-01-09 14:29:34,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:29:34,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 300 [2025-01-09 14:29:34,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:34,099 INFO L225 Difference]: With dead ends: 3101 [2025-01-09 14:29:34,099 INFO L226 Difference]: Without dead ends: 1563 [2025-01-09 14:29:34,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:29:34,101 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 138 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:34,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 829 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:29:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-01-09 14:29:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1549. [2025-01-09 14:29:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1475 states have (on average 1.5654237288135593) internal successors, (2309), 1482 states have internal predecessors, (2309), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 58 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 14:29:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2439 transitions. [2025-01-09 14:29:34,154 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2439 transitions. Word has length 300 [2025-01-09 14:29:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:34,154 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 2439 transitions. [2025-01-09 14:29:34,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2439 transitions. [2025-01-09 14:29:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-01-09 14:29:34,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:34,161 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:34,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:29:34,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:34,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 368110927, now seen corresponding path program 1 times [2025-01-09 14:29:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198168597] [2025-01-09 14:29:34,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:34,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-09 14:29:34,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-09 14:29:34,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:34,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:34,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:34,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198168597] [2025-01-09 14:29:34,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198168597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:34,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:34,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:29:34,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518259350] [2025-01-09 14:29:34,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:34,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:29:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:34,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:29:34,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:29:34,296 INFO L87 Difference]: Start difference. First operand 1549 states and 2439 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:34,408 INFO L93 Difference]: Finished difference Result 3161 states and 4961 transitions. [2025-01-09 14:29:34,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:29:34,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 300 [2025-01-09 14:29:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:34,416 INFO L225 Difference]: With dead ends: 3161 [2025-01-09 14:29:34,416 INFO L226 Difference]: Without dead ends: 1615 [2025-01-09 14:29:34,418 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:29:34,419 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 160 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:34,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 673 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:29:34,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-01-09 14:29:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1549. [2025-01-09 14:29:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1483 states have (on average 1.5664194200944033) internal successors, (2323), 1486 states have internal predecessors, (2323), 57 states have call successors, (57), 8 states have call predecessors, (57), 8 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 14:29:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2437 transitions. [2025-01-09 14:29:34,472 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2437 transitions. Word has length 300 [2025-01-09 14:29:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:34,473 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 2437 transitions. [2025-01-09 14:29:34,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2437 transitions. [2025-01-09 14:29:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-01-09 14:29:34,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:34,479 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:34,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:29:34,480 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:34,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1913053383, now seen corresponding path program 1 times [2025-01-09 14:29:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:34,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859250315] [2025-01-09 14:29:34,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:34,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-09 14:29:34,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-09 14:29:34,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:34,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859250315] [2025-01-09 14:29:35,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859250315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:35,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:35,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:29:35,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753849865] [2025-01-09 14:29:35,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:35,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:29:35,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:35,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:29:35,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:35,126 INFO L87 Difference]: Start difference. First operand 1549 states and 2437 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:35,508 INFO L93 Difference]: Finished difference Result 5991 states and 9442 transitions. [2025-01-09 14:29:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:29:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 300 [2025-01-09 14:29:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:35,526 INFO L225 Difference]: With dead ends: 5991 [2025-01-09 14:29:35,527 INFO L226 Difference]: Without dead ends: 4445 [2025-01-09 14:29:35,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:29:35,530 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 545 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:35,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 840 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:29:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2025-01-09 14:29:35,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 3085. [2025-01-09 14:29:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3085 states, 2954 states have (on average 1.5646580907244414) internal successors, (4622), 2960 states have internal predecessors, (4622), 114 states have call successors, (114), 16 states have call predecessors, (114), 16 states have return successors, (114), 108 states have call predecessors, (114), 114 states have call successors, (114) [2025-01-09 14:29:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 4850 transitions. [2025-01-09 14:29:35,649 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 4850 transitions. Word has length 300 [2025-01-09 14:29:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:35,650 INFO L471 AbstractCegarLoop]: Abstraction has 3085 states and 4850 transitions. [2025-01-09 14:29:35,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 4850 transitions. [2025-01-09 14:29:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-01-09 14:29:35,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:35,658 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:35,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:29:35,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:35,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:35,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2028825531, now seen corresponding path program 1 times [2025-01-09 14:29:35,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:35,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829243200] [2025-01-09 14:29:35,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:35,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:35,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-09 14:29:35,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-09 14:29:35,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:35,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:36,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:36,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829243200] [2025-01-09 14:29:36,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829243200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:36,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:36,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:29:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563387311] [2025-01-09 14:29:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:36,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:29:36,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:36,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:29:36,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:29:36,241 INFO L87 Difference]: Start difference. First operand 3085 states and 4850 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:36,752 INFO L93 Difference]: Finished difference Result 8055 states and 12703 transitions. [2025-01-09 14:29:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:29:36,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 300 [2025-01-09 14:29:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:36,777 INFO L225 Difference]: With dead ends: 8055 [2025-01-09 14:29:36,777 INFO L226 Difference]: Without dead ends: 4973 [2025-01-09 14:29:36,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:29:36,784 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 519 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:36,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1363 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:29:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states. [2025-01-09 14:29:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4827. [2025-01-09 14:29:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4827 states, 4592 states have (on average 1.5409407665505226) internal successors, (7076), 4600 states have internal predecessors, (7076), 208 states have call successors, (208), 26 states have call predecessors, (208), 26 states have return successors, (208), 200 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 14:29:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4827 states to 4827 states and 7492 transitions. [2025-01-09 14:29:37,026 INFO L78 Accepts]: Start accepts. Automaton has 4827 states and 7492 transitions. Word has length 300 [2025-01-09 14:29:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:37,026 INFO L471 AbstractCegarLoop]: Abstraction has 4827 states and 7492 transitions. [2025-01-09 14:29:37,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4827 states and 7492 transitions. [2025-01-09 14:29:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-01-09 14:29:37,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:37,039 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:37,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:29:37,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:37,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2051457785, now seen corresponding path program 1 times [2025-01-09 14:29:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:37,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269330928] [2025-01-09 14:29:37,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:37,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:37,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-09 14:29:37,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-09 14:29:37,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:37,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:37,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:37,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269330928] [2025-01-09 14:29:37,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269330928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:37,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:37,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:29:37,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037463530] [2025-01-09 14:29:37,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:37,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:29:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:37,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:29:37,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:37,540 INFO L87 Difference]: Start difference. First operand 4827 states and 7492 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:37,755 INFO L93 Difference]: Finished difference Result 9695 states and 15048 transitions. [2025-01-09 14:29:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:29:37,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 300 [2025-01-09 14:29:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:37,781 INFO L225 Difference]: With dead ends: 9695 [2025-01-09 14:29:37,781 INFO L226 Difference]: Without dead ends: 4871 [2025-01-09 14:29:37,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:29:37,793 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 157 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:37,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 864 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:29:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2025-01-09 14:29:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4851. [2025-01-09 14:29:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 4616 states have (on average 1.5381282495667243) internal successors, (7100), 4624 states have internal predecessors, (7100), 208 states have call successors, (208), 26 states have call predecessors, (208), 26 states have return successors, (208), 200 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 14:29:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 7516 transitions. [2025-01-09 14:29:38,027 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 7516 transitions. Word has length 300 [2025-01-09 14:29:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:38,028 INFO L471 AbstractCegarLoop]: Abstraction has 4851 states and 7516 transitions. [2025-01-09 14:29:38,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 7516 transitions. [2025-01-09 14:29:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-09 14:29:38,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:38,041 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:38,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:29:38,041 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:38,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1407854648, now seen corresponding path program 1 times [2025-01-09 14:29:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:38,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494145687] [2025-01-09 14:29:38,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:38,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:38,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 14:29:38,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 14:29:38,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:38,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:39,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:39,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494145687] [2025-01-09 14:29:39,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494145687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:39,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:39,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:29:39,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89810417] [2025-01-09 14:29:39,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:39,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:29:39,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:39,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:29:39,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:29:39,930 INFO L87 Difference]: Start difference. First operand 4851 states and 7516 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:40,628 INFO L93 Difference]: Finished difference Result 11257 states and 17312 transitions. [2025-01-09 14:29:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:29:40,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 301 [2025-01-09 14:29:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:40,658 INFO L225 Difference]: With dead ends: 11257 [2025-01-09 14:29:40,659 INFO L226 Difference]: Without dead ends: 6409 [2025-01-09 14:29:40,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:29:40,668 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 697 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:40,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1843 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:29:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6409 states. [2025-01-09 14:29:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6409 to 5175. [2025-01-09 14:29:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5175 states, 4940 states have (on average 1.5421052631578946) internal successors, (7618), 4948 states have internal predecessors, (7618), 208 states have call successors, (208), 26 states have call predecessors, (208), 26 states have return successors, (208), 200 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 14:29:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 8034 transitions. [2025-01-09 14:29:40,922 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 8034 transitions. Word has length 301 [2025-01-09 14:29:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:40,923 INFO L471 AbstractCegarLoop]: Abstraction has 5175 states and 8034 transitions. [2025-01-09 14:29:40,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 8034 transitions. [2025-01-09 14:29:40,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-09 14:29:40,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:40,936 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:40,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:29:40,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:40,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:40,937 INFO L85 PathProgramCache]: Analyzing trace with hash -706254774, now seen corresponding path program 1 times [2025-01-09 14:29:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:40,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250979584] [2025-01-09 14:29:40,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:40,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 14:29:41,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 14:29:41,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:41,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:42,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:42,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250979584] [2025-01-09 14:29:42,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250979584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:42,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:42,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:29:42,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181884941] [2025-01-09 14:29:42,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:42,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:29:42,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:42,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:29:42,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:29:42,450 INFO L87 Difference]: Start difference. First operand 5175 states and 8034 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:43,549 INFO L93 Difference]: Finished difference Result 13297 states and 20543 transitions. [2025-01-09 14:29:43,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:29:43,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 301 [2025-01-09 14:29:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:43,569 INFO L225 Difference]: With dead ends: 13297 [2025-01-09 14:29:43,569 INFO L226 Difference]: Without dead ends: 8125 [2025-01-09 14:29:43,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:29:43,578 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 483 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:43,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1585 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:29:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8125 states. [2025-01-09 14:29:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8125 to 5731. [2025-01-09 14:29:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5731 states, 5496 states have (on average 1.547307132459971) internal successors, (8504), 5504 states have internal predecessors, (8504), 208 states have call successors, (208), 26 states have call predecessors, (208), 26 states have return successors, (208), 200 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 14:29:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5731 states to 5731 states and 8920 transitions. [2025-01-09 14:29:43,771 INFO L78 Accepts]: Start accepts. Automaton has 5731 states and 8920 transitions. Word has length 301 [2025-01-09 14:29:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:43,771 INFO L471 AbstractCegarLoop]: Abstraction has 5731 states and 8920 transitions. [2025-01-09 14:29:43,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 5731 states and 8920 transitions. [2025-01-09 14:29:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:29:43,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:43,782 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:43,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:29:43,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:43,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash -431554306, now seen corresponding path program 1 times [2025-01-09 14:29:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:43,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626605792] [2025-01-09 14:29:43,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:43,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:43,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:29:44,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:29:44,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:44,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:45,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626605792] [2025-01-09 14:29:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626605792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:45,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:45,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:29:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368338725] [2025-01-09 14:29:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:45,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:29:45,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:45,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:29:45,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:29:45,552 INFO L87 Difference]: Start difference. First operand 5731 states and 8920 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:46,343 INFO L93 Difference]: Finished difference Result 15473 states and 23916 transitions. [2025-01-09 14:29:46,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:29:46,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:29:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:46,372 INFO L225 Difference]: With dead ends: 15473 [2025-01-09 14:29:46,372 INFO L226 Difference]: Without dead ends: 9745 [2025-01-09 14:29:46,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:29:46,386 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 515 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:46,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1158 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:29:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9745 states. [2025-01-09 14:29:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9745 to 5731. [2025-01-09 14:29:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5731 states, 5496 states have (on average 1.547307132459971) internal successors, (8504), 5504 states have internal predecessors, (8504), 208 states have call successors, (208), 26 states have call predecessors, (208), 26 states have return successors, (208), 200 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 14:29:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5731 states to 5731 states and 8920 transitions. [2025-01-09 14:29:46,584 INFO L78 Accepts]: Start accepts. Automaton has 5731 states and 8920 transitions. Word has length 302 [2025-01-09 14:29:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:46,585 INFO L471 AbstractCegarLoop]: Abstraction has 5731 states and 8920 transitions. [2025-01-09 14:29:46,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 5731 states and 8920 transitions. [2025-01-09 14:29:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:29:46,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:46,596 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:46,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:29:46,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:46,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1328947584, now seen corresponding path program 1 times [2025-01-09 14:29:46,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:46,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858643605] [2025-01-09 14:29:46,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:46,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:46,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:29:46,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:29:46,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:46,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:46,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858643605] [2025-01-09 14:29:46,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858643605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:46,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:46,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:29:46,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585580145] [2025-01-09 14:29:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:46,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:29:46,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:46,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:29:46,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:46,942 INFO L87 Difference]: Start difference. First operand 5731 states and 8920 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:47,220 INFO L93 Difference]: Finished difference Result 13833 states and 21433 transitions. [2025-01-09 14:29:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:29:47,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:29:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:47,240 INFO L225 Difference]: With dead ends: 13833 [2025-01-09 14:29:47,241 INFO L226 Difference]: Without dead ends: 8081 [2025-01-09 14:29:47,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:29:47,254 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 350 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:47,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 762 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:29:47,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8081 states. [2025-01-09 14:29:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8081 to 6811. [2025-01-09 14:29:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6811 states, 6576 states have (on average 1.5574817518248176) internal successors, (10242), 6584 states have internal predecessors, (10242), 208 states have call successors, (208), 26 states have call predecessors, (208), 26 states have return successors, (208), 200 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 14:29:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6811 states to 6811 states and 10658 transitions. [2025-01-09 14:29:47,456 INFO L78 Accepts]: Start accepts. Automaton has 6811 states and 10658 transitions. Word has length 302 [2025-01-09 14:29:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:47,457 INFO L471 AbstractCegarLoop]: Abstraction has 6811 states and 10658 transitions. [2025-01-09 14:29:47,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6811 states and 10658 transitions. [2025-01-09 14:29:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:29:47,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:47,470 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:47,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:29:47,470 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:47,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1504447812, now seen corresponding path program 1 times [2025-01-09 14:29:47,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:47,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110447151] [2025-01-09 14:29:47,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:47,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:47,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:29:47,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:29:47,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:47,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:48,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:48,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110447151] [2025-01-09 14:29:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110447151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:48,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:48,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:29:48,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692761127] [2025-01-09 14:29:48,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:48,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:29:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:48,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:29:48,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:29:48,246 INFO L87 Difference]: Start difference. First operand 6811 states and 10658 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:48,841 INFO L93 Difference]: Finished difference Result 17581 states and 27492 transitions. [2025-01-09 14:29:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:29:48,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:29:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:48,868 INFO L225 Difference]: With dead ends: 17581 [2025-01-09 14:29:48,868 INFO L226 Difference]: Without dead ends: 10773 [2025-01-09 14:29:48,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:29:48,881 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 195 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:48,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1263 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:29:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10773 states. [2025-01-09 14:29:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10773 to 6231. [2025-01-09 14:29:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6231 states, 5996 states have (on average 1.5600400266844563) internal successors, (9354), 6004 states have internal predecessors, (9354), 208 states have call successors, (208), 26 states have call predecessors, (208), 26 states have return successors, (208), 200 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 14:29:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 9770 transitions. [2025-01-09 14:29:49,072 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 9770 transitions. Word has length 302 [2025-01-09 14:29:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:49,073 INFO L471 AbstractCegarLoop]: Abstraction has 6231 states and 9770 transitions. [2025-01-09 14:29:49,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 9770 transitions. [2025-01-09 14:29:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:29:49,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:49,084 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:49,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:29:49,085 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:49,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2141860265, now seen corresponding path program 1 times [2025-01-09 14:29:49,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:49,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506506842] [2025-01-09 14:29:49,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:49,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:49,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:29:49,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:29:49,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:49,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:51,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506506842] [2025-01-09 14:29:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506506842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:51,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:51,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:29:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306565417] [2025-01-09 14:29:51,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:51,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:29:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:51,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:29:51,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:29:51,123 INFO L87 Difference]: Start difference. First operand 6231 states and 9770 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:51,961 INFO L93 Difference]: Finished difference Result 14415 states and 22410 transitions. [2025-01-09 14:29:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:29:51,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:29:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:51,983 INFO L225 Difference]: With dead ends: 14415 [2025-01-09 14:29:51,983 INFO L226 Difference]: Without dead ends: 8187 [2025-01-09 14:29:51,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:29:51,995 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 773 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:51,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1569 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:29:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2025-01-09 14:29:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 6121. [2025-01-09 14:29:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6121 states, 5886 states have (on average 1.5562351342167855) internal successors, (9160), 5894 states have internal predecessors, (9160), 208 states have call successors, (208), 26 states have call predecessors, (208), 26 states have return successors, (208), 200 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 14:29:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 9576 transitions. [2025-01-09 14:29:52,200 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 9576 transitions. Word has length 302 [2025-01-09 14:29:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:52,200 INFO L471 AbstractCegarLoop]: Abstraction has 6121 states and 9576 transitions. [2025-01-09 14:29:52,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 9576 transitions. [2025-01-09 14:29:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:29:52,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:52,213 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:52,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:29:52,213 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:52,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1451507157, now seen corresponding path program 1 times [2025-01-09 14:29:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:52,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223604817] [2025-01-09 14:29:52,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:52,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:29:52,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:29:52,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:52,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:53,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:53,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223604817] [2025-01-09 14:29:53,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223604817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:53,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:53,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:29:53,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546550667] [2025-01-09 14:29:53,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:53,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:29:53,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:53,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:29:53,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:29:53,877 INFO L87 Difference]: Start difference. First operand 6121 states and 9576 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:54,914 INFO L93 Difference]: Finished difference Result 14865 states and 22999 transitions. [2025-01-09 14:29:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:29:54,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:29:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:54,939 INFO L225 Difference]: With dead ends: 14865 [2025-01-09 14:29:54,939 INFO L226 Difference]: Without dead ends: 8747 [2025-01-09 14:29:54,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:29:54,952 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 394 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:54,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1776 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:29:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8747 states. [2025-01-09 14:29:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8747 to 5355. [2025-01-09 14:29:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5355 states, 5120 states have (on average 1.549609375) internal successors, (7934), 5128 states have internal predecessors, (7934), 208 states have call successors, (208), 26 states have call predecessors, (208), 26 states have return successors, (208), 200 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 14:29:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5355 states to 5355 states and 8350 transitions. [2025-01-09 14:29:55,112 INFO L78 Accepts]: Start accepts. Automaton has 5355 states and 8350 transitions. Word has length 302 [2025-01-09 14:29:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:55,115 INFO L471 AbstractCegarLoop]: Abstraction has 5355 states and 8350 transitions. [2025-01-09 14:29:55,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 5355 states and 8350 transitions. [2025-01-09 14:29:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:29:55,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:55,123 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:55,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:29:55,123 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:55,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:55,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1212243721, now seen corresponding path program 1 times [2025-01-09 14:29:55,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:55,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739499853] [2025-01-09 14:29:55,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:55,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:29:55,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:29:55,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:55,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:55,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:55,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739499853] [2025-01-09 14:29:55,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739499853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:55,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:55,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:29:55,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137552120] [2025-01-09 14:29:55,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:55,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:29:55,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:55,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:29:55,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:29:55,223 INFO L87 Difference]: Start difference. First operand 5355 states and 8350 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:55,390 INFO L93 Difference]: Finished difference Result 10903 states and 16998 transitions. [2025-01-09 14:29:55,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:29:55,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:29:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:55,406 INFO L225 Difference]: With dead ends: 10903 [2025-01-09 14:29:55,406 INFO L226 Difference]: Without dead ends: 5551 [2025-01-09 14:29:55,413 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:29:55,414 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 177 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:55,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 703 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:29:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5551 states. [2025-01-09 14:29:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5551 to 4335. [2025-01-09 14:29:55,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4335 states, 4230 states have (on average 1.5867612293144209) internal successors, (6712), 4232 states have internal predecessors, (6712), 94 states have call successors, (94), 10 states have call predecessors, (94), 10 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 14:29:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 6900 transitions. [2025-01-09 14:29:55,510 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 6900 transitions. Word has length 302 [2025-01-09 14:29:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:55,511 INFO L471 AbstractCegarLoop]: Abstraction has 4335 states and 6900 transitions. [2025-01-09 14:29:55,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 6900 transitions. [2025-01-09 14:29:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:29:55,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:55,519 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:55,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 14:29:55,519 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:55,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1287269555, now seen corresponding path program 1 times [2025-01-09 14:29:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:55,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152537651] [2025-01-09 14:29:55,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:55,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:29:55,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:29:55,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:55,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:56,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152537651] [2025-01-09 14:29:56,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152537651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:56,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:56,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:29:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031731482] [2025-01-09 14:29:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:56,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:29:56,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:56,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:29:56,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:29:56,831 INFO L87 Difference]: Start difference. First operand 4335 states and 6900 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:57,757 INFO L93 Difference]: Finished difference Result 11521 states and 18237 transitions. [2025-01-09 14:29:57,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:29:57,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:29:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:57,774 INFO L225 Difference]: With dead ends: 11521 [2025-01-09 14:29:57,775 INFO L226 Difference]: Without dead ends: 7189 [2025-01-09 14:29:57,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:29:57,784 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 542 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:57,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1620 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:29:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7189 states. [2025-01-09 14:29:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7189 to 4339. [2025-01-09 14:29:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4339 states, 4234 states have (on average 1.5866792631081719) internal successors, (6718), 4236 states have internal predecessors, (6718), 94 states have call successors, (94), 10 states have call predecessors, (94), 10 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 14:29:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 6906 transitions. [2025-01-09 14:29:57,885 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 6906 transitions. Word has length 302 [2025-01-09 14:29:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:57,886 INFO L471 AbstractCegarLoop]: Abstraction has 4339 states and 6906 transitions. [2025-01-09 14:29:57,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 6906 transitions. [2025-01-09 14:29:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:29:57,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:57,893 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:57,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 14:29:57,893 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:57,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash -837144121, now seen corresponding path program 1 times [2025-01-09 14:29:57,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:57,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140856080] [2025-01-09 14:29:57,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:57,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:29:57,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:29:57,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:57,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:29:58,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:58,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140856080] [2025-01-09 14:29:58,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140856080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:58,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:58,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:29:58,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389236918] [2025-01-09 14:29:58,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:58,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:29:58,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:58,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:29:58,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:29:58,792 INFO L87 Difference]: Start difference. First operand 4339 states and 6906 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:59,742 INFO L93 Difference]: Finished difference Result 12183 states and 19243 transitions. [2025-01-09 14:29:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:29:59,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:29:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:59,756 INFO L225 Difference]: With dead ends: 12183 [2025-01-09 14:29:59,757 INFO L226 Difference]: Without dead ends: 7847 [2025-01-09 14:29:59,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:29:59,761 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 595 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:59,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 2664 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:29:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7847 states. [2025-01-09 14:29:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7847 to 4869. [2025-01-09 14:29:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4764 states have (on average 1.5726280436607893) internal successors, (7492), 4766 states have internal predecessors, (7492), 94 states have call successors, (94), 10 states have call predecessors, (94), 10 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 14:29:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7680 transitions. [2025-01-09 14:29:59,897 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7680 transitions. Word has length 302 [2025-01-09 14:29:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:59,898 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 7680 transitions. [2025-01-09 14:29:59,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:29:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7680 transitions. [2025-01-09 14:29:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:29:59,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:59,905 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:59,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 14:29:59,905 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:59,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1517609505, now seen corresponding path program 1 times [2025-01-09 14:29:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:59,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317518436] [2025-01-09 14:29:59,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:59,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:29:59,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:29:59,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:59,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:30:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317518436] [2025-01-09 14:30:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317518436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:00,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:00,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:30:00,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915018460] [2025-01-09 14:30:00,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:00,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:30:00,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:00,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:30:00,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:30:00,046 INFO L87 Difference]: Start difference. First operand 4869 states and 7680 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:30:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:00,100 INFO L93 Difference]: Finished difference Result 10039 states and 15805 transitions. [2025-01-09 14:30:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:30:00,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:30:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:00,111 INFO L225 Difference]: With dead ends: 10039 [2025-01-09 14:30:00,112 INFO L226 Difference]: Without dead ends: 5173 [2025-01-09 14:30:00,117 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:30:00,118 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 121 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:00,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 602 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:30:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2025-01-09 14:30:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 4869. [2025-01-09 14:30:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4764 states have (on average 1.572208228379513) internal successors, (7490), 4766 states have internal predecessors, (7490), 94 states have call successors, (94), 10 states have call predecessors, (94), 10 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 14:30:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7678 transitions. [2025-01-09 14:30:00,281 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7678 transitions. Word has length 302 [2025-01-09 14:30:00,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:00,282 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 7678 transitions. [2025-01-09 14:30:00,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:30:00,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7678 transitions. [2025-01-09 14:30:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:30:00,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:00,297 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:00,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 14:30:00,297 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:00,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1558284255, now seen corresponding path program 1 times [2025-01-09 14:30:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:00,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440544832] [2025-01-09 14:30:00,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:00,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:30:00,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:30:00,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:00,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:30:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440544832] [2025-01-09 14:30:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440544832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:30:00,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671997186] [2025-01-09 14:30:00,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:00,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:30:00,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:00,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:30:00,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:30:00,765 INFO L87 Difference]: Start difference. First operand 4869 states and 7678 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:30:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:01,086 INFO L93 Difference]: Finished difference Result 10489 states and 16466 transitions. [2025-01-09 14:30:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:30:01,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:30:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:01,120 INFO L225 Difference]: With dead ends: 10489 [2025-01-09 14:30:01,120 INFO L226 Difference]: Without dead ends: 5623 [2025-01-09 14:30:01,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:30:01,123 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 435 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:01,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 2009 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:30:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5623 states. [2025-01-09 14:30:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5623 to 4607. [2025-01-09 14:30:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4607 states, 4512 states have (on average 1.565159574468085) internal successors, (7062), 4512 states have internal predecessors, (7062), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 14:30:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 7234 transitions. [2025-01-09 14:30:01,204 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 7234 transitions. Word has length 302 [2025-01-09 14:30:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:01,205 INFO L471 AbstractCegarLoop]: Abstraction has 4607 states and 7234 transitions. [2025-01-09 14:30:01,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:30:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 7234 transitions. [2025-01-09 14:30:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 14:30:01,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:01,211 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:01,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 14:30:01,211 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:01,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:01,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1580916509, now seen corresponding path program 1 times [2025-01-09 14:30:01,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:01,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762540826] [2025-01-09 14:30:01,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:01,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:01,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 14:30:01,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 14:30:01,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:01,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:30:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:02,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762540826] [2025-01-09 14:30:02,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762540826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:02,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:02,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:30:02,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676758495] [2025-01-09 14:30:02,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:02,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:30:02,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:02,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:30:02,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:30:02,899 INFO L87 Difference]: Start difference. First operand 4607 states and 7234 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:30:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:05,171 INFO L93 Difference]: Finished difference Result 12899 states and 20134 transitions. [2025-01-09 14:30:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 14:30:05,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 302 [2025-01-09 14:30:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:05,185 INFO L225 Difference]: With dead ends: 12899 [2025-01-09 14:30:05,185 INFO L226 Difference]: Without dead ends: 8295 [2025-01-09 14:30:05,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:30:05,191 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 482 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:05,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 3329 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 14:30:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8295 states. [2025-01-09 14:30:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8295 to 4607. [2025-01-09 14:30:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4607 states, 4512 states have (on average 1.565159574468085) internal successors, (7062), 4512 states have internal predecessors, (7062), 86 states have call successors, (86), 8 states have call predecessors, (86), 8 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 14:30:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 7234 transitions. [2025-01-09 14:30:05,286 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 7234 transitions. Word has length 302 [2025-01-09 14:30:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:05,286 INFO L471 AbstractCegarLoop]: Abstraction has 4607 states and 7234 transitions. [2025-01-09 14:30:05,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:30:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 7234 transitions. [2025-01-09 14:30:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-01-09 14:30:05,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:05,293 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:05,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 14:30:05,294 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:05,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1201007612, now seen corresponding path program 1 times [2025-01-09 14:30:05,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:05,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359580707] [2025-01-09 14:30:05,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:05,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:05,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 14:30:05,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 14:30:05,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:05,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 6 proven. 120 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:30:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359580707] [2025-01-09 14:30:05,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359580707] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:05,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301863934] [2025-01-09 14:30:05,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:05,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:05,924 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:30:05,926 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:30:06,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 14:30:06,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 14:30:06,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:06,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:06,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:30:06,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 366 proven. 120 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2025-01-09 14:30:06,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:30:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 6 proven. 120 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:30:06,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301863934] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:30:06,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:30:06,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:30:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209624873] [2025-01-09 14:30:06,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:30:06,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:30:06,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:06,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:30:06,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:30:06,977 INFO L87 Difference]: Start difference. First operand 4607 states and 7234 transitions. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) [2025-01-09 14:30:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:07,267 INFO L93 Difference]: Finished difference Result 7601 states and 11945 transitions. [2025-01-09 14:30:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:30:07,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) Word has length 303 [2025-01-09 14:30:07,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:07,275 INFO L225 Difference]: With dead ends: 7601 [2025-01-09 14:30:07,275 INFO L226 Difference]: Without dead ends: 2997 [2025-01-09 14:30:07,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:30:07,281 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 522 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:07,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 604 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:30:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2025-01-09 14:30:07,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2881. [2025-01-09 14:30:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2881 states, 2784 states have (on average 1.555316091954023) internal successors, (4330), 2784 states have internal predecessors, (4330), 86 states have call successors, (86), 10 states have call predecessors, (86), 10 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 14:30:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4502 transitions. [2025-01-09 14:30:07,367 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 4502 transitions. Word has length 303 [2025-01-09 14:30:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:07,368 INFO L471 AbstractCegarLoop]: Abstraction has 2881 states and 4502 transitions. [2025-01-09 14:30:07,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 3 states have call successors, (123), 2 states have call predecessors, (123), 4 states have return successors, (124), 3 states have call predecessors, (124), 3 states have call successors, (124) [2025-01-09 14:30:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 4502 transitions. [2025-01-09 14:30:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-01-09 14:30:07,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:07,373 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,384 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:30:07,574 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,SelfDestructingSolverStorable24 [2025-01-09 14:30:07,575 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:07,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1716445213, now seen corresponding path program 1 times [2025-01-09 14:30:07,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:07,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934575153] [2025-01-09 14:30:07,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:07,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 14:30:07,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 14:30:07,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:07,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 12 proven. 114 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:30:07,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:07,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934575153] [2025-01-09 14:30:07,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934575153] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:07,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254935823] [2025-01-09 14:30:07,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:07,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:07,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:07,989 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:30:07,990 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:30:08,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 14:30:08,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 14:30:08,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:08,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:08,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:30:08,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 918 proven. 108 refuted. 0 times theorem prover too weak. 2586 trivial. 0 not checked. [2025-01-09 14:30:08,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:30:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:30:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254935823] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:30:08,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:30:08,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:30:08,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121766189] [2025-01-09 14:30:08,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:30:08,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:30:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:08,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:30:08,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:30:08,812 INFO L87 Difference]: Start difference. First operand 2881 states and 4502 transitions. Second operand has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-01-09 14:30:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:09,172 INFO L93 Difference]: Finished difference Result 4234 states and 6585 transitions. [2025-01-09 14:30:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:30:09,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) Word has length 303 [2025-01-09 14:30:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:09,177 INFO L225 Difference]: With dead ends: 4234 [2025-01-09 14:30:09,177 INFO L226 Difference]: Without dead ends: 1356 [2025-01-09 14:30:09,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 603 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:30:09,179 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 503 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:09,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 609 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:30:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-01-09 14:30:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1275. [2025-01-09 14:30:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1174 states have (on average 1.5374787052810903) internal successors, (1805), 1174 states have internal predecessors, (1805), 86 states have call successors, (86), 14 states have call predecessors, (86), 14 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 14:30:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1977 transitions. [2025-01-09 14:30:09,250 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1977 transitions. Word has length 303 [2025-01-09 14:30:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:09,251 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1977 transitions. [2025-01-09 14:30:09,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.375) internal successors, (139), 8 states have internal predecessors, (139), 3 states have call successors, (117), 2 states have call predecessors, (117), 4 states have return successors, (119), 3 states have call predecessors, (119), 3 states have call successors, (119) [2025-01-09 14:30:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1977 transitions. [2025-01-09 14:30:09,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-01-09 14:30:09,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:09,255 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:09,265 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:30:09,455 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,SelfDestructingSolverStorable25 [2025-01-09 14:30:09,456 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:09,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1483005917, now seen corresponding path program 1 times [2025-01-09 14:30:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:09,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645052515] [2025-01-09 14:30:09,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:09,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:09,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 14:30:09,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 14:30:09,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:09,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-01-09 14:30:09,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:09,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645052515] [2025-01-09 14:30:09,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645052515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:30:09,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:30:09,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:30:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653049149] [2025-01-09 14:30:09,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:30:09,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:30:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:09,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:30:09,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:30:09,779 INFO L87 Difference]: Start difference. First operand 1275 states and 1977 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:30:09,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:09,890 INFO L93 Difference]: Finished difference Result 4089 states and 6337 transitions. [2025-01-09 14:30:09,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:30:09,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 303 [2025-01-09 14:30:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:09,897 INFO L225 Difference]: With dead ends: 4089 [2025-01-09 14:30:09,897 INFO L226 Difference]: Without dead ends: 2817 [2025-01-09 14:30:09,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:30:09,900 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 230 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:09,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 883 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:30:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2025-01-09 14:30:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2417. [2025-01-09 14:30:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2417 states, 2216 states have (on average 1.5243682310469313) internal successors, (3378), 2216 states have internal predecessors, (3378), 172 states have call successors, (172), 28 states have call predecessors, (172), 28 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 14:30:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 3722 transitions. [2025-01-09 14:30:10,006 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 3722 transitions. Word has length 303 [2025-01-09 14:30:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:10,006 INFO L471 AbstractCegarLoop]: Abstraction has 2417 states and 3722 transitions. [2025-01-09 14:30:10,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-01-09 14:30:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3722 transitions. [2025-01-09 14:30:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-01-09 14:30:10,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:10,009 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 14:30:10,009 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:10,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1425757985, now seen corresponding path program 1 times [2025-01-09 14:30:10,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:10,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849353636] [2025-01-09 14:30:10,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:10,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:10,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 14:30:10,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 14:30:10,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:10,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 33 proven. 93 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-01-09 14:30:10,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:10,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849353636] [2025-01-09 14:30:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849353636] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:10,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595185574] [2025-01-09 14:30:10,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:10,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:10,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:10,904 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:30:10,905 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:30:11,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 14:30:11,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 14:30:11,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:11,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:11,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 14:30:11,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1461 proven. 180 refuted. 0 times theorem prover too weak. 1971 trivial. 0 not checked. [2025-01-09 14:30:12,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:30:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 66 proven. 183 refuted. 0 times theorem prover too weak. 3363 trivial. 0 not checked. [2025-01-09 14:30:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595185574] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:30:13,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:30:13,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2025-01-09 14:30:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819445675] [2025-01-09 14:30:13,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:30:13,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 14:30:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:13,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 14:30:13,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2025-01-09 14:30:13,069 INFO L87 Difference]: Start difference. First operand 2417 states and 3722 transitions. Second operand has 27 states, 26 states have (on average 9.846153846153847) internal successors, (256), 25 states have internal predecessors, (256), 9 states have call successors, (129), 4 states have call predecessors, (129), 8 states have return successors, (129), 9 states have call predecessors, (129), 9 states have call successors, (129) [2025-01-09 14:30:16,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:16,139 INFO L93 Difference]: Finished difference Result 11795 states and 17385 transitions. [2025-01-09 14:30:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 14:30:16,140 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 9.846153846153847) internal successors, (256), 25 states have internal predecessors, (256), 9 states have call successors, (129), 4 states have call predecessors, (129), 8 states have return successors, (129), 9 states have call predecessors, (129), 9 states have call successors, (129) Word has length 303 [2025-01-09 14:30:16,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:16,155 INFO L225 Difference]: With dead ends: 11795 [2025-01-09 14:30:16,155 INFO L226 Difference]: Without dead ends: 9381 [2025-01-09 14:30:16,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=749, Invalid=2007, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 14:30:16,159 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 1763 mSDsluCounter, 3178 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1820 SdHoareTripleChecker+Valid, 3417 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:16,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1820 Valid, 3417 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 14:30:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9381 states. [2025-01-09 14:30:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9381 to 7005. [2025-01-09 14:30:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7005 states, 6452 states have (on average 1.510229386236826) internal successors, (9744), 6460 states have internal predecessors, (9744), 432 states have call successors, (432), 120 states have call predecessors, (432), 120 states have return successors, (432), 424 states have call predecessors, (432), 432 states have call successors, (432) [2025-01-09 14:30:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 10608 transitions. [2025-01-09 14:30:16,553 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 10608 transitions. Word has length 303 [2025-01-09 14:30:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:16,554 INFO L471 AbstractCegarLoop]: Abstraction has 7005 states and 10608 transitions. [2025-01-09 14:30:16,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 9.846153846153847) internal successors, (256), 25 states have internal predecessors, (256), 9 states have call successors, (129), 4 states have call predecessors, (129), 8 states have return successors, (129), 9 states have call predecessors, (129), 9 states have call successors, (129) [2025-01-09 14:30:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 10608 transitions. [2025-01-09 14:30:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-01-09 14:30:16,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:16,558 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:16,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:30:16,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:16,759 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:16,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1040219208, now seen corresponding path program 1 times [2025-01-09 14:30:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:16,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29227275] [2025-01-09 14:30:16,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:16,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-09 14:30:17,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-09 14:30:17,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:17,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:30:17,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590258223] [2025-01-09 14:30:17,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:17,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:17,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:17,046 INFO L229 MonitoredProcess]: Starting monitored process 5 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:30:17,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:30:17,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-09 14:30:17,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-09 14:30:17,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:17,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:17,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:30:17,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 1848 proven. 63 refuted. 0 times theorem prover too weak. 1701 trivial. 0 not checked. [2025-01-09 14:30:17,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:30:18,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29227275] [2025-01-09 14:30:18,140 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:30:18,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590258223] [2025-01-09 14:30:18,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590258223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:18,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:30:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-01-09 14:30:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630212031] [2025-01-09 14:30:18,140 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:30:18,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:30:18,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:18,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:30:18,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:30:18,142 INFO L87 Difference]: Start difference. First operand 7005 states and 10608 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:30:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:30:19,261 INFO L93 Difference]: Finished difference Result 20296 states and 30428 transitions. [2025-01-09 14:30:19,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:30:19,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 304 [2025-01-09 14:30:19,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:30:19,280 INFO L225 Difference]: With dead ends: 20296 [2025-01-09 14:30:19,280 INFO L226 Difference]: Without dead ends: 13294 [2025-01-09 14:30:19,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:30:19,291 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 741 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:30:19,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1590 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:30:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13294 states. [2025-01-09 14:30:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13294 to 13084. [2025-01-09 14:30:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13084 states, 12037 states have (on average 1.488909196643682) internal successors, (17922), 12061 states have internal predecessors, (17922), 795 states have call successors, (795), 251 states have call predecessors, (795), 251 states have return successors, (795), 771 states have call predecessors, (795), 795 states have call successors, (795) [2025-01-09 14:30:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13084 states to 13084 states and 19512 transitions. [2025-01-09 14:30:19,995 INFO L78 Accepts]: Start accepts. Automaton has 13084 states and 19512 transitions. Word has length 304 [2025-01-09 14:30:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:30:19,995 INFO L471 AbstractCegarLoop]: Abstraction has 13084 states and 19512 transitions. [2025-01-09 14:30:19,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-01-09 14:30:19,995 INFO L276 IsEmpty]: Start isEmpty. Operand 13084 states and 19512 transitions. [2025-01-09 14:30:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-01-09 14:30:20,000 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:30:20,001 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:20,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:30:20,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 14:30:20,201 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:30:20,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:30:20,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1363576443, now seen corresponding path program 1 times [2025-01-09 14:30:20,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:30:20,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539726364] [2025-01-09 14:30:20,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:20,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:30:20,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-09 14:30:20,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-09 14:30:20,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:20,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 117 proven. 129 refuted. 0 times theorem prover too weak. 3366 trivial. 0 not checked. [2025-01-09 14:30:22,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:30:22,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539726364] [2025-01-09 14:30:22,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539726364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:22,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656769325] [2025-01-09 14:30:22,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:30:22,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:30:22,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:30:22,247 INFO L229 MonitoredProcess]: Starting monitored process 6 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:30:22,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:30:22,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-09 14:30:22,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-09 14:30:22,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:30:22,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:30:22,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 14:30:22,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:30:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 2555 proven. 240 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2025-01-09 14:30:24,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:30:25,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656769325] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:30:25,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:30:25,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2025-01-09 14:30:25,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411302549] [2025-01-09 14:30:25,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:30:25,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 14:30:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:30:25,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 14:30:25,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1239, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 14:30:25,057 INFO L87 Difference]: Start difference. First operand 13084 states and 19512 transitions. Second operand has 32 states, 31 states have (on average 6.387096774193548) internal successors, (198), 29 states have internal predecessors, (198), 11 states have call successors, (86), 8 states have call predecessors, (86), 12 states have return successors, (86), 10 states have call predecessors, (86), 11 states have call successors, (86)