./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.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 7ce47381267ee67677a133028db906aae8ff01d6ab9cce9bbfb67fc1f629a942 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:49:52,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:49:52,821 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:49:52,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:49:52,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:49:52,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:49:52,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:49:52,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:49:52,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:49:52,841 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:49:52,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:49:52,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:49:52,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:49:52,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:49:52,842 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:49:52,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:49:52,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:49:52,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:49:52,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:49:52,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:49:52,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:49:52,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:49:52,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:49:52,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:49:52,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:49:52,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:49:52,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:49:52,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:49:52,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:49:52,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:49:52,844 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:49:52,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:49:52,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:49:52,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:49:52,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:49:52,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:49:52,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:49:52,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:49:52,845 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 -> 7ce47381267ee67677a133028db906aae8ff01d6ab9cce9bbfb67fc1f629a942 [2025-01-09 14:49:53,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:49:53,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:49:53,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:49:53,070 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:49:53,070 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:49:53,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.i [2025-01-09 14:49:54,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e8702d72/6fc03ad9ea5f4e8a81f220f4f1bf2408/FLAGcf33ddd10 [2025-01-09 14:49:54,534 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:49:54,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.i [2025-01-09 14:49:54,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e8702d72/6fc03ad9ea5f4e8a81f220f4f1bf2408/FLAGcf33ddd10 [2025-01-09 14:49:54,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e8702d72/6fc03ad9ea5f4e8a81f220f4f1bf2408 [2025-01-09 14:49:54,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:49:54,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:49:54,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:49:54,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:49:54,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:49:54,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:54" (1/1) ... [2025-01-09 14:49:54,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f92fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:54, skipping insertion in model container [2025-01-09 14:49:54,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:49:54" (1/1) ... [2025-01-09 14:49:54,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:49:54,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.i[916,929] [2025-01-09 14:49:54,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:49:54,921 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:49:54,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-70.i[916,929] [2025-01-09 14:49:54,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:49:55,013 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:49:55,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55 WrapperNode [2025-01-09 14:49:55,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:49:55,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:49:55,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:49:55,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:49:55,022 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:49:55" (1/1) ... [2025-01-09 14:49:55,039 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:49:55" (1/1) ... [2025-01-09 14:49:55,144 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 706 [2025-01-09 14:49:55,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:49:55,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:49:55,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:49:55,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:49:55,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,262 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:49:55,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:49:55,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:49:55,326 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:49:55,326 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:49:55,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (1/1) ... [2025-01-09 14:49:55,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:49:55,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:49:55,354 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:49:55,361 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:49:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:49:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:49:55,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:49:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:49:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:49:55,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:49:55,481 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:49:55,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:49:56,362 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-01-09 14:49:56,362 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:49:56,374 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:49:56,377 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:49:56,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:56 BoogieIcfgContainer [2025-01-09 14:49:56,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:49:56,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:49:56,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:49:56,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:49:56,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:49:54" (1/3) ... [2025-01-09 14:49:56,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694adf64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:56, skipping insertion in model container [2025-01-09 14:49:56,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:49:55" (2/3) ... [2025-01-09 14:49:56,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694adf64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:49:56, skipping insertion in model container [2025-01-09 14:49:56,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:49:56" (3/3) ... [2025-01-09 14:49:56,388 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-70.i [2025-01-09 14:49:56,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:49:56,405 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-70.i that has 2 procedures, 280 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:49:56,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:49:56,456 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;@7a6ec9f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:49:56,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:49:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 217 states have (on average 1.5529953917050692) internal successors, (337), 218 states have internal predecessors, (337), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 14:49:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:49:56,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:56,472 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:56,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:56,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1582319367, now seen corresponding path program 1 times [2025-01-09 14:49:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:56,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912302777] [2025-01-09 14:49:56,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:56,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:56,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:49:56,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:49:56,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:56,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-01-09 14:49:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912302777] [2025-01-09 14:49:56,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912302777] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:49:56,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325258870] [2025-01-09 14:49:56,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:56,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:49:56,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:49:56,918 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:49:56,919 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:49:57,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:49:57,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:49:57,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:57,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:57,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:49:57,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:49:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-01-09 14:49:57,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:49:57,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325258870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:57,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:49:57,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:49:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054240321] [2025-01-09 14:49:57,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:57,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:49:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:57,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:49:57,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:49:57,308 INFO L87 Difference]: Start difference. First operand has 280 states, 217 states have (on average 1.5529953917050692) internal successors, (337), 218 states have internal predecessors, (337), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:49:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:57,361 INFO L93 Difference]: Finished difference Result 552 states and 965 transitions. [2025-01-09 14:49:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:49:57,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) Word has length 432 [2025-01-09 14:49:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:57,371 INFO L225 Difference]: With dead ends: 552 [2025-01-09 14:49:57,371 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 14:49:57,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:49:57,376 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:57,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 14:49:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-01-09 14:49:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 213 states have (on average 1.5352112676056338) internal successors, (327), 213 states have internal predecessors, (327), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 14:49:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 447 transitions. [2025-01-09 14:49:57,443 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 447 transitions. Word has length 432 [2025-01-09 14:49:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:57,444 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 447 transitions. [2025-01-09 14:49:57,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:49:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 447 transitions. [2025-01-09 14:49:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:49:57,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:57,455 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:57,475 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:49:57,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:49:57,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:57,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash -201798671, now seen corresponding path program 1 times [2025-01-09 14:49:57,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:57,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154857234] [2025-01-09 14:49:57,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:57,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:49:57,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:49:57,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:57,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:49:58,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:58,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154857234] [2025-01-09 14:49:58,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154857234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:58,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:58,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:49:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952570066] [2025-01-09 14:49:58,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:58,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:49:58,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:58,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:49:58,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:58,154 INFO L87 Difference]: Start difference. First operand 275 states and 447 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:49:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:58,413 INFO L93 Difference]: Finished difference Result 963 states and 1571 transitions. [2025-01-09 14:49:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:49:58,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-01-09 14:49:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:58,421 INFO L225 Difference]: With dead ends: 963 [2025-01-09 14:49:58,421 INFO L226 Difference]: Without dead ends: 691 [2025-01-09 14:49:58,422 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:49:58,422 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 659 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:58,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1406 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:49:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-01-09 14:49:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 534. [2025-01-09 14:49:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 436 states have (on average 1.5802752293577982) internal successors, (689), 437 states have internal predecessors, (689), 95 states have call successors, (95), 2 states have call predecessors, (95), 2 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 14:49:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 879 transitions. [2025-01-09 14:49:58,481 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 879 transitions. Word has length 432 [2025-01-09 14:49:58,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:58,483 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 879 transitions. [2025-01-09 14:49:58,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:49:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 879 transitions. [2025-01-09 14:49:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:49:58,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:58,488 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:58,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:49:58,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:58,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash -933766097, now seen corresponding path program 1 times [2025-01-09 14:49:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:58,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050616865] [2025-01-09 14:49:58,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:58,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:58,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:49:58,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:49:58,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:58,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:49:58,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:58,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050616865] [2025-01-09 14:49:58,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050616865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:58,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:58,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607832495] [2025-01-09 14:49:58,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:58,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:58,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:58,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:58,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:58,811 INFO L87 Difference]: Start difference. First operand 534 states and 879 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:49:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:58,919 INFO L93 Difference]: Finished difference Result 1579 states and 2601 transitions. [2025-01-09 14:49:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:58,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-01-09 14:49:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:58,931 INFO L225 Difference]: With dead ends: 1579 [2025-01-09 14:49:58,931 INFO L226 Difference]: Without dead ends: 1048 [2025-01-09 14:49:58,933 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:49:58,933 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 431 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:58,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1050 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:49:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-01-09 14:49:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 597. [2025-01-09 14:49:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 499 states have (on average 1.591182364729459) internal successors, (794), 500 states have internal predecessors, (794), 95 states have call successors, (95), 2 states have call predecessors, (95), 2 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 14:49:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 984 transitions. [2025-01-09 14:49:58,987 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 984 transitions. Word has length 432 [2025-01-09 14:49:58,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:58,989 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 984 transitions. [2025-01-09 14:49:58,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:49:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 984 transitions. [2025-01-09 14:49:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:49:58,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:58,995 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:58,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:49:58,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:58,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash -554429909, now seen corresponding path program 1 times [2025-01-09 14:49:58,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:58,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97841120] [2025-01-09 14:49:58,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:59,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:49:59,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:49:59,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:59,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:49:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:59,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97841120] [2025-01-09 14:49:59,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97841120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:59,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:59,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054321759] [2025-01-09 14:49:59,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:59,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:59,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:59,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:59,250 INFO L87 Difference]: Start difference. First operand 597 states and 984 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:49:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:59,325 INFO L93 Difference]: Finished difference Result 1772 states and 2921 transitions. [2025-01-09 14:49:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:59,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-01-09 14:49:59,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:59,331 INFO L225 Difference]: With dead ends: 1772 [2025-01-09 14:49:59,331 INFO L226 Difference]: Without dead ends: 1178 [2025-01-09 14:49:59,332 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:49:59,332 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 424 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:59,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 986 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2025-01-09 14:49:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 664. [2025-01-09 14:49:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 566 states have (on average 1.6042402826855124) internal successors, (908), 567 states have internal predecessors, (908), 95 states have call successors, (95), 2 states have call predecessors, (95), 2 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 14:49:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1098 transitions. [2025-01-09 14:49:59,372 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1098 transitions. Word has length 432 [2025-01-09 14:49:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:59,372 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 1098 transitions. [2025-01-09 14:49:59,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:49:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1098 transitions. [2025-01-09 14:49:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:49:59,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:59,377 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:59,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:49:59,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:59,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:59,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1583789207, now seen corresponding path program 1 times [2025-01-09 14:49:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:59,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006338293] [2025-01-09 14:49:59,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:59,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:49:59,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:49:59,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:59,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:49:59,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006338293] [2025-01-09 14:49:59,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006338293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:59,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:59,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:59,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640430193] [2025-01-09 14:49:59,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:59,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:59,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:59,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:59,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:59,625 INFO L87 Difference]: Start difference. First operand 664 states and 1098 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:49:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:59,735 INFO L93 Difference]: Finished difference Result 1968 states and 3252 transitions. [2025-01-09 14:49:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:59,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 432 [2025-01-09 14:49:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:59,742 INFO L225 Difference]: With dead ends: 1968 [2025-01-09 14:49:59,742 INFO L226 Difference]: Without dead ends: 1307 [2025-01-09 14:49:59,744 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:49:59,744 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 390 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:59,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 845 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:49:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-01-09 14:49:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 946. [2025-01-09 14:49:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 848 states have (on average 1.6096698113207548) internal successors, (1365), 849 states have internal predecessors, (1365), 95 states have call successors, (95), 2 states have call predecessors, (95), 2 states have return successors, (95), 94 states have call predecessors, (95), 95 states have call successors, (95) [2025-01-09 14:49:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1555 transitions. [2025-01-09 14:49:59,798 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1555 transitions. Word has length 432 [2025-01-09 14:49:59,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:59,798 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1555 transitions. [2025-01-09 14:49:59,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:49:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1555 transitions. [2025-01-09 14:49:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-01-09 14:49:59,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:59,803 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:59,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:49:59,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:59,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash -181167629, now seen corresponding path program 1 times [2025-01-09 14:49:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449135955] [2025-01-09 14:49:59,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:59,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-09 14:49:59,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-09 14:49:59,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:59,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:00,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449135955] [2025-01-09 14:50:00,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449135955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:00,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:00,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:00,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582335266] [2025-01-09 14:50:00,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:00,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:00,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:00,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:00,344 INFO L87 Difference]: Start difference. First operand 946 states and 1555 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:00,665 INFO L93 Difference]: Finished difference Result 2773 states and 4566 transitions. [2025-01-09 14:50:00,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:00,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 433 [2025-01-09 14:50:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:00,674 INFO L225 Difference]: With dead ends: 2773 [2025-01-09 14:50:00,674 INFO L226 Difference]: Without dead ends: 1830 [2025-01-09 14:50:00,676 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:50:00,676 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 335 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:00,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1287 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2025-01-09 14:50:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1748. [2025-01-09 14:50:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1589 states have (on average 1.6249213341724356) internal successors, (2582), 1590 states have internal predecessors, (2582), 155 states have call successors, (155), 3 states have call predecessors, (155), 3 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 14:50:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2892 transitions. [2025-01-09 14:50:00,758 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2892 transitions. Word has length 433 [2025-01-09 14:50:00,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:00,759 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2892 transitions. [2025-01-09 14:50:00,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2892 transitions. [2025-01-09 14:50:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-01-09 14:50:00,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:00,765 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:50:00,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:00,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1492849794, now seen corresponding path program 1 times [2025-01-09 14:50:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:00,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546700414] [2025-01-09 14:50:00,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:00,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-01-09 14:50:00,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-01-09 14:50:00,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:00,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:01,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:01,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546700414] [2025-01-09 14:50:01,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546700414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:01,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:01,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:01,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125024269] [2025-01-09 14:50:01,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:01,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:01,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:01,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:01,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:01,243 INFO L87 Difference]: Start difference. First operand 1748 states and 2892 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:01,540 INFO L93 Difference]: Finished difference Result 3463 states and 5725 transitions. [2025-01-09 14:50:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:01,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 434 [2025-01-09 14:50:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:01,550 INFO L225 Difference]: With dead ends: 3463 [2025-01-09 14:50:01,550 INFO L226 Difference]: Without dead ends: 1830 [2025-01-09 14:50:01,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:01,553 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 331 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:01,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1290 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:01,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2025-01-09 14:50:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1750. [2025-01-09 14:50:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1591 states have (on average 1.6235072281583909) internal successors, (2583), 1592 states have internal predecessors, (2583), 155 states have call successors, (155), 3 states have call predecessors, (155), 3 states have return successors, (155), 154 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 14:50:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2893 transitions. [2025-01-09 14:50:01,608 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2893 transitions. Word has length 434 [2025-01-09 14:50:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:01,608 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2893 transitions. [2025-01-09 14:50:01,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2893 transitions. [2025-01-09 14:50:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-09 14:50:01,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:01,613 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:01,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:50:01,614 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:01,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash 4297520, now seen corresponding path program 1 times [2025-01-09 14:50:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:01,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32159280] [2025-01-09 14:50:01,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:01,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:01,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-09 14:50:01,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-09 14:50:01,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:01,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:02,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32159280] [2025-01-09 14:50:02,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32159280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:02,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:02,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:02,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259142917] [2025-01-09 14:50:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:02,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:02,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:02,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:02,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:02,329 INFO L87 Difference]: Start difference. First operand 1750 states and 2893 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:02,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:02,526 INFO L93 Difference]: Finished difference Result 4183 states and 6878 transitions. [2025-01-09 14:50:02,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:02,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-01-09 14:50:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:02,537 INFO L225 Difference]: With dead ends: 4183 [2025-01-09 14:50:02,537 INFO L226 Difference]: Without dead ends: 3018 [2025-01-09 14:50:02,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:02,540 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 375 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:02,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1421 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:50:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2025-01-09 14:50:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2664. [2025-01-09 14:50:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2485 states have (on average 1.6285714285714286) internal successors, (4047), 2488 states have internal predecessors, (4047), 173 states have call successors, (173), 5 states have call predecessors, (173), 5 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-01-09 14:50:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4393 transitions. [2025-01-09 14:50:02,632 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4393 transitions. Word has length 435 [2025-01-09 14:50:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:02,632 INFO L471 AbstractCegarLoop]: Abstraction has 2664 states and 4393 transitions. [2025-01-09 14:50:02,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4393 transitions. [2025-01-09 14:50:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-09 14:50:02,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:02,637 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:02,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:50:02,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:02,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1367509778, now seen corresponding path program 1 times [2025-01-09 14:50:02,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:02,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850013104] [2025-01-09 14:50:02,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:02,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:02,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-09 14:50:03,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-09 14:50:03,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:03,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:03,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:03,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850013104] [2025-01-09 14:50:03,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850013104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:03,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:03,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:03,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663413988] [2025-01-09 14:50:03,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:03,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:03,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:03,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:03,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:03,846 INFO L87 Difference]: Start difference. First operand 2664 states and 4393 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:04,122 INFO L93 Difference]: Finished difference Result 5649 states and 9284 transitions. [2025-01-09 14:50:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:04,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-01-09 14:50:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:04,137 INFO L225 Difference]: With dead ends: 5649 [2025-01-09 14:50:04,137 INFO L226 Difference]: Without dead ends: 3594 [2025-01-09 14:50:04,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:04,143 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 654 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:04,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 2092 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-01-09 14:50:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 2602. [2025-01-09 14:50:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2423 states have (on average 1.6215435410647958) internal successors, (3929), 2426 states have internal predecessors, (3929), 173 states have call successors, (173), 5 states have call predecessors, (173), 5 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-01-09 14:50:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 4275 transitions. [2025-01-09 14:50:04,224 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 4275 transitions. Word has length 435 [2025-01-09 14:50:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:04,225 INFO L471 AbstractCegarLoop]: Abstraction has 2602 states and 4275 transitions. [2025-01-09 14:50:04,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 4275 transitions. [2025-01-09 14:50:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-09 14:50:04,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:04,230 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:04,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:50:04,231 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:04,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash -321971284, now seen corresponding path program 1 times [2025-01-09 14:50:04,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:04,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820467844] [2025-01-09 14:50:04,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:04,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-09 14:50:04,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-09 14:50:04,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:04,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:05,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820467844] [2025-01-09 14:50:05,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820467844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:05,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:05,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035787818] [2025-01-09 14:50:05,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:05,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:05,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:05,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:05,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:05,221 INFO L87 Difference]: Start difference. First operand 2602 states and 4275 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:05,478 INFO L93 Difference]: Finished difference Result 6282 states and 10303 transitions. [2025-01-09 14:50:05,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-01-09 14:50:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:05,493 INFO L225 Difference]: With dead ends: 6282 [2025-01-09 14:50:05,493 INFO L226 Difference]: Without dead ends: 3835 [2025-01-09 14:50:05,498 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:50:05,499 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 925 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:05,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1675 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2025-01-09 14:50:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 1716. [2025-01-09 14:50:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1581 states have (on average 1.6059456040480709) internal successors, (2539), 1582 states have internal predecessors, (2539), 129 states have call successors, (129), 5 states have call predecessors, (129), 5 states have return successors, (129), 128 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 14:50:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2797 transitions. [2025-01-09 14:50:05,572 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2797 transitions. Word has length 435 [2025-01-09 14:50:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:05,572 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2797 transitions. [2025-01-09 14:50:05,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:05,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2797 transitions. [2025-01-09 14:50:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-01-09 14:50:05,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:05,578 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:50:05,578 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:05,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash -120147350, now seen corresponding path program 1 times [2025-01-09 14:50:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525495989] [2025-01-09 14:50:05,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:05,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-01-09 14:50:05,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-01-09 14:50:05,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:05,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:06,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525495989] [2025-01-09 14:50:06,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525495989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:06,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:06,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:06,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120465477] [2025-01-09 14:50:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:06,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:06,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:06,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:06,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:06,190 INFO L87 Difference]: Start difference. First operand 1716 states and 2797 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:06,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:06,681 INFO L93 Difference]: Finished difference Result 5974 states and 9745 transitions. [2025-01-09 14:50:06,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:06,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 435 [2025-01-09 14:50:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:06,706 INFO L225 Difference]: With dead ends: 5974 [2025-01-09 14:50:06,706 INFO L226 Difference]: Without dead ends: 4605 [2025-01-09 14:50:06,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:50:06,709 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1023 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:06,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 2033 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4605 states. [2025-01-09 14:50:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4605 to 2840. [2025-01-09 14:50:06,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2705 states have (on average 1.6129390018484289) internal successors, (4363), 2706 states have internal predecessors, (4363), 129 states have call successors, (129), 5 states have call predecessors, (129), 5 states have return successors, (129), 128 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 14:50:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 4621 transitions. [2025-01-09 14:50:06,802 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 4621 transitions. Word has length 435 [2025-01-09 14:50:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:06,803 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 4621 transitions. [2025-01-09 14:50:06,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 4621 transitions. [2025-01-09 14:50:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 14:50:06,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:06,809 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:06,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:50:06,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:06,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash 276653036, now seen corresponding path program 1 times [2025-01-09 14:50:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243618212] [2025-01-09 14:50:06,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:06,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 14:50:07,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 14:50:07,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:07,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:07,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:07,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243618212] [2025-01-09 14:50:07,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243618212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:07,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:07,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:50:07,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388144610] [2025-01-09 14:50:07,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:07,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:50:07,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:07,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:50:07,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:07,799 INFO L87 Difference]: Start difference. First operand 2840 states and 4621 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:08,335 INFO L93 Difference]: Finished difference Result 5899 states and 9526 transitions. [2025-01-09 14:50:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:08,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-01-09 14:50:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:08,353 INFO L225 Difference]: With dead ends: 5899 [2025-01-09 14:50:08,354 INFO L226 Difference]: Without dead ends: 4324 [2025-01-09 14:50:08,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:50:08,357 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 548 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:08,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1990 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:50:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4324 states. [2025-01-09 14:50:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4324 to 3554. [2025-01-09 14:50:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3554 states, 3394 states have (on average 1.6122569239835003) internal successors, (5472), 3397 states have internal predecessors, (5472), 151 states have call successors, (151), 8 states have call predecessors, (151), 8 states have return successors, (151), 148 states have call predecessors, (151), 151 states have call successors, (151) [2025-01-09 14:50:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 5774 transitions. [2025-01-09 14:50:08,490 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 5774 transitions. Word has length 436 [2025-01-09 14:50:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:08,491 INFO L471 AbstractCegarLoop]: Abstraction has 3554 states and 5774 transitions. [2025-01-09 14:50:08,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 5774 transitions. [2025-01-09 14:50:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 14:50:08,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:08,497 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:50:08,498 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:08,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash -327619290, now seen corresponding path program 1 times [2025-01-09 14:50:08,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:08,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631761151] [2025-01-09 14:50:08,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:08,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:08,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 14:50:08,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 14:50:08,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:08,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:08,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:08,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631761151] [2025-01-09 14:50:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631761151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:08,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401314911] [2025-01-09 14:50:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:08,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:09,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:09,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:09,000 INFO L87 Difference]: Start difference. First operand 3554 states and 5774 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:09,261 INFO L93 Difference]: Finished difference Result 10658 states and 17343 transitions. [2025-01-09 14:50:09,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:09,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-01-09 14:50:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:09,275 INFO L225 Difference]: With dead ends: 10658 [2025-01-09 14:50:09,275 INFO L226 Difference]: Without dead ends: 7417 [2025-01-09 14:50:09,280 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:50:09,280 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 418 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:09,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1497 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7417 states. [2025-01-09 14:50:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7417 to 6832. [2025-01-09 14:50:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6832 states, 6628 states have (on average 1.6161738080869041) internal successors, (10712), 6635 states have internal predecessors, (10712), 191 states have call successors, (191), 12 states have call predecessors, (191), 12 states have return successors, (191), 184 states have call predecessors, (191), 191 states have call successors, (191) [2025-01-09 14:50:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6832 states to 6832 states and 11094 transitions. [2025-01-09 14:50:09,435 INFO L78 Accepts]: Start accepts. Automaton has 6832 states and 11094 transitions. Word has length 436 [2025-01-09 14:50:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:09,436 INFO L471 AbstractCegarLoop]: Abstraction has 6832 states and 11094 transitions. [2025-01-09 14:50:09,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6832 states and 11094 transitions. [2025-01-09 14:50:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 14:50:09,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:09,443 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:09,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:50:09,443 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:09,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:09,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2056305448, now seen corresponding path program 1 times [2025-01-09 14:50:09,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:09,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016186632] [2025-01-09 14:50:09,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:09,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 14:50:09,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 14:50:09,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:09,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:09,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:09,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016186632] [2025-01-09 14:50:09,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016186632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:09,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:09,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293405285] [2025-01-09 14:50:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:09,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:09,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:09,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:09,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:09,588 INFO L87 Difference]: Start difference. First operand 6832 states and 11094 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:09,709 INFO L93 Difference]: Finished difference Result 11870 states and 19263 transitions. [2025-01-09 14:50:09,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:09,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 436 [2025-01-09 14:50:09,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:09,725 INFO L225 Difference]: With dead ends: 11870 [2025-01-09 14:50:09,725 INFO L226 Difference]: Without dead ends: 6848 [2025-01-09 14:50:09,731 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:50:09,731 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 213 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:09,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1099 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:50:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2025-01-09 14:50:09,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 4802. [2025-01-09 14:50:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4802 states, 4639 states have (on average 1.6078896313860747) internal successors, (7459), 4642 states have internal predecessors, (7459), 151 states have call successors, (151), 11 states have call predecessors, (151), 11 states have return successors, (151), 148 states have call predecessors, (151), 151 states have call successors, (151) [2025-01-09 14:50:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7761 transitions. [2025-01-09 14:50:09,886 INFO L78 Accepts]: Start accepts. Automaton has 4802 states and 7761 transitions. Word has length 436 [2025-01-09 14:50:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:09,887 INFO L471 AbstractCegarLoop]: Abstraction has 4802 states and 7761 transitions. [2025-01-09 14:50:09,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:09,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4802 states and 7761 transitions. [2025-01-09 14:50:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:50:09,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:09,892 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:09,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:50:09,892 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:09,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1642097852, now seen corresponding path program 1 times [2025-01-09 14:50:09,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:09,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601007986] [2025-01-09 14:50:09,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:09,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:09,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:10,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:10,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:10,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601007986] [2025-01-09 14:50:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601007986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:10,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:10,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:50:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145773150] [2025-01-09 14:50:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:10,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:50:10,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:10,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:50:10,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:10,643 INFO L87 Difference]: Start difference. First operand 4802 states and 7761 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:11,014 INFO L93 Difference]: Finished difference Result 11282 states and 18194 transitions. [2025-01-09 14:50:11,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:11,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 437 [2025-01-09 14:50:11,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:11,029 INFO L225 Difference]: With dead ends: 11282 [2025-01-09 14:50:11,029 INFO L226 Difference]: Without dead ends: 8584 [2025-01-09 14:50:11,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:11,035 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 781 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:11,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1554 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8584 states. [2025-01-09 14:50:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8584 to 4922. [2025-01-09 14:50:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4922 states, 4759 states have (on average 1.612733767598235) internal successors, (7675), 4762 states have internal predecessors, (7675), 151 states have call successors, (151), 11 states have call predecessors, (151), 11 states have return successors, (151), 148 states have call predecessors, (151), 151 states have call successors, (151) [2025-01-09 14:50:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4922 states to 4922 states and 7977 transitions. [2025-01-09 14:50:11,145 INFO L78 Accepts]: Start accepts. Automaton has 4922 states and 7977 transitions. Word has length 437 [2025-01-09 14:50:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:11,146 INFO L471 AbstractCegarLoop]: Abstraction has 4922 states and 7977 transitions. [2025-01-09 14:50:11,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 4922 states and 7977 transitions. [2025-01-09 14:50:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:50:11,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:11,151 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:11,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:50:11,151 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:11,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1759383106, now seen corresponding path program 1 times [2025-01-09 14:50:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:11,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954944061] [2025-01-09 14:50:11,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:11,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:11,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:11,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:11,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:12,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:12,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954944061] [2025-01-09 14:50:12,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954944061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:12,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:12,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:12,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987132034] [2025-01-09 14:50:12,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:12,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:12,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:12,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:12,038 INFO L87 Difference]: Start difference. First operand 4922 states and 7977 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:12,285 INFO L93 Difference]: Finished difference Result 12074 states and 19614 transitions. [2025-01-09 14:50:12,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:50:12,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 437 [2025-01-09 14:50:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:12,301 INFO L225 Difference]: With dead ends: 12074 [2025-01-09 14:50:12,301 INFO L226 Difference]: Without dead ends: 7722 [2025-01-09 14:50:12,309 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:50:12,310 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 705 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:12,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 863 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7722 states. [2025-01-09 14:50:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7722 to 3994. [2025-01-09 14:50:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3994 states, 3849 states have (on average 1.5733956871914783) internal successors, (6056), 3850 states have internal predecessors, (6056), 133 states have call successors, (133), 11 states have call predecessors, (133), 11 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 14:50:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 6322 transitions. [2025-01-09 14:50:12,420 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 6322 transitions. Word has length 437 [2025-01-09 14:50:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:12,420 INFO L471 AbstractCegarLoop]: Abstraction has 3994 states and 6322 transitions. [2025-01-09 14:50:12,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 6322 transitions. [2025-01-09 14:50:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:50:12,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:12,425 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:12,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:50:12,425 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:12,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1163776892, now seen corresponding path program 1 times [2025-01-09 14:50:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041936696] [2025-01-09 14:50:12,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:12,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:12,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:12,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:12,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:13,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:13,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041936696] [2025-01-09 14:50:13,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041936696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:13,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:13,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:50:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901115505] [2025-01-09 14:50:13,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:13,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:50:13,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:13,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:50:13,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:50:13,409 INFO L87 Difference]: Start difference. First operand 3994 states and 6322 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:13,835 INFO L93 Difference]: Finished difference Result 9306 states and 14741 transitions. [2025-01-09 14:50:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:50:13,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 437 [2025-01-09 14:50:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:13,848 INFO L225 Difference]: With dead ends: 9306 [2025-01-09 14:50:13,849 INFO L226 Difference]: Without dead ends: 6470 [2025-01-09 14:50:13,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:50:13,855 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 423 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:13,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 2510 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6470 states. [2025-01-09 14:50:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6470 to 4010. [2025-01-09 14:50:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 3865 states have (on average 1.573091849935317) internal successors, (6080), 3866 states have internal predecessors, (6080), 133 states have call successors, (133), 11 states have call predecessors, (133), 11 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 14:50:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 6346 transitions. [2025-01-09 14:50:13,981 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 6346 transitions. Word has length 437 [2025-01-09 14:50:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:13,982 INFO L471 AbstractCegarLoop]: Abstraction has 4010 states and 6346 transitions. [2025-01-09 14:50:13,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 6346 transitions. [2025-01-09 14:50:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-09 14:50:13,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:13,987 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:13,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:50:13,987 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:13,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:13,988 INFO L85 PathProgramCache]: Analyzing trace with hash 340647707, now seen corresponding path program 1 times [2025-01-09 14:50:13,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:13,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441406537] [2025-01-09 14:50:13,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:13,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:14,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:14,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:14,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:14,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3 proven. 174 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:50:15,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441406537] [2025-01-09 14:50:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441406537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22933550] [2025-01-09 14:50:15,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:15,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:15,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:15,034 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:50:15,035 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:50:15,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-09 14:50:15,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-09 14:50:15,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:15,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:15,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:50:15,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 293 proven. 174 refuted. 0 times theorem prover too weak. 6613 trivial. 0 not checked. [2025-01-09 14:50:16,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3 proven. 174 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:50:16,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22933550] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:16,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:16,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2025-01-09 14:50:16,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035682610] [2025-01-09 14:50:16,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:16,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:50:16,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:16,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:50:16,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:50:16,663 INFO L87 Difference]: Start difference. First operand 4010 states and 6346 transitions. Second operand has 11 states, 11 states have (on average 26.0) internal successors, (286), 11 states have internal predecessors, (286), 4 states have call successors, (176), 2 states have call predecessors, (176), 4 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) [2025-01-09 14:50:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:17,170 INFO L93 Difference]: Finished difference Result 7194 states and 11386 transitions. [2025-01-09 14:50:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:50:17,170 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 26.0) internal successors, (286), 11 states have internal predecessors, (286), 4 states have call successors, (176), 2 states have call predecessors, (176), 4 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) Word has length 437 [2025-01-09 14:50:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:17,177 INFO L225 Difference]: With dead ends: 7194 [2025-01-09 14:50:17,177 INFO L226 Difference]: Without dead ends: 4052 [2025-01-09 14:50:17,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 871 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:50:17,180 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 1360 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:17,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 913 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2025-01-09 14:50:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 4030. [2025-01-09 14:50:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 3880 states have (on average 1.552319587628866) internal successors, (6023), 3881 states have internal predecessors, (6023), 133 states have call successors, (133), 16 states have call predecessors, (133), 16 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 14:50:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 6289 transitions. [2025-01-09 14:50:17,277 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 6289 transitions. Word has length 437 [2025-01-09 14:50:17,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:17,278 INFO L471 AbstractCegarLoop]: Abstraction has 4030 states and 6289 transitions. [2025-01-09 14:50:17,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.0) internal successors, (286), 11 states have internal predecessors, (286), 4 states have call successors, (176), 2 states have call predecessors, (176), 4 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) [2025-01-09 14:50:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 6289 transitions. [2025-01-09 14:50:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:50:17,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:17,284 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:17,292 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:50:17,484 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,SelfDestructingSolverStorable17 [2025-01-09 14:50:17,485 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:17,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:17,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1597557130, now seen corresponding path program 1 times [2025-01-09 14:50:17,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:17,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878223457] [2025-01-09 14:50:17,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:17,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:17,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:18,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:18,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:18,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 36 proven. 141 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:50:19,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:19,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878223457] [2025-01-09 14:50:19,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878223457] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:19,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120804369] [2025-01-09 14:50:19,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:19,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:19,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:19,129 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:50:19,130 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:50:19,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:19,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:19,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:19,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:19,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:50:19,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3443 proven. 69 refuted. 0 times theorem prover too weak. 3568 trivial. 0 not checked. [2025-01-09 14:50:19,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 108 proven. 69 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:50:19,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120804369] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:19,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:19,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:50:19,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493143151] [2025-01-09 14:50:19,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:19,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:50:19,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:19,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:50:19,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:50:19,955 INFO L87 Difference]: Start difference. First operand 4030 states and 6289 transitions. Second operand has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 3 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (132), 3 states have call predecessors, (132), 3 states have call successors, (132) [2025-01-09 14:50:20,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:20,450 INFO L93 Difference]: Finished difference Result 6698 states and 10459 transitions. [2025-01-09 14:50:20,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:50:20,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 3 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (132), 3 states have call predecessors, (132), 3 states have call successors, (132) Word has length 438 [2025-01-09 14:50:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:20,458 INFO L225 Difference]: With dead ends: 6698 [2025-01-09 14:50:20,459 INFO L226 Difference]: Without dead ends: 2901 [2025-01-09 14:50:20,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 873 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:50:20,464 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 828 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:20,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 939 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2025-01-09 14:50:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2113. [2025-01-09 14:50:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1977 states have (on average 1.5386949924127467) internal successors, (3042), 1977 states have internal predecessors, (3042), 120 states have call successors, (120), 15 states have call predecessors, (120), 15 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 3282 transitions. [2025-01-09 14:50:20,556 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 3282 transitions. Word has length 438 [2025-01-09 14:50:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:20,556 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 3282 transitions. [2025-01-09 14:50:20,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 states have internal predecessors, (203), 3 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (132), 3 states have call predecessors, (132), 3 states have call successors, (132) [2025-01-09 14:50:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3282 transitions. [2025-01-09 14:50:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:50:20,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:20,561 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:20,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:50:20,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:20,765 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:20,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1262652353, now seen corresponding path program 1 times [2025-01-09 14:50:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:20,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219426071] [2025-01-09 14:50:20,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:20,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:21,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:21,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:21,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:21,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219426071] [2025-01-09 14:50:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219426071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:21,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:21,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:50:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986981528] [2025-01-09 14:50:21,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:21,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:50:21,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:21,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:50:21,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:50:21,844 INFO L87 Difference]: Start difference. First operand 2113 states and 3282 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:22,293 INFO L93 Difference]: Finished difference Result 5438 states and 8428 transitions. [2025-01-09 14:50:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:50:22,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-01-09 14:50:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:22,302 INFO L225 Difference]: With dead ends: 5438 [2025-01-09 14:50:22,302 INFO L226 Difference]: Without dead ends: 4246 [2025-01-09 14:50:22,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:50:22,306 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 1753 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:22,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 1932 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4246 states. [2025-01-09 14:50:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4246 to 2341. [2025-01-09 14:50:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2341 states, 2205 states have (on average 1.5464852607709751) internal successors, (3410), 2205 states have internal predecessors, (3410), 120 states have call successors, (120), 15 states have call predecessors, (120), 15 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 2341 states and 3650 transitions. [2025-01-09 14:50:22,371 INFO L78 Accepts]: Start accepts. Automaton has 2341 states and 3650 transitions. Word has length 438 [2025-01-09 14:50:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:22,371 INFO L471 AbstractCegarLoop]: Abstraction has 2341 states and 3650 transitions. [2025-01-09 14:50:22,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 3650 transitions. [2025-01-09 14:50:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:50:22,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:22,375 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:22,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 14:50:22,375 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:22,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash 635494791, now seen corresponding path program 1 times [2025-01-09 14:50:22,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:22,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88856551] [2025-01-09 14:50:22,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:22,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:22,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:22,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:22,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:22,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:23,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:23,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88856551] [2025-01-09 14:50:23,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88856551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:50:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414522118] [2025-01-09 14:50:23,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:23,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:50:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:23,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:50:23,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:23,175 INFO L87 Difference]: Start difference. First operand 2341 states and 3650 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:23,494 INFO L93 Difference]: Finished difference Result 4870 states and 7575 transitions. [2025-01-09 14:50:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:23,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-01-09 14:50:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:23,500 INFO L225 Difference]: With dead ends: 4870 [2025-01-09 14:50:23,500 INFO L226 Difference]: Without dead ends: 2875 [2025-01-09 14:50:23,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:50:23,503 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 943 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:23,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1386 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2025-01-09 14:50:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2511. [2025-01-09 14:50:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2375 states have (on average 1.5334736842105263) internal successors, (3642), 2375 states have internal predecessors, (3642), 120 states have call successors, (120), 15 states have call predecessors, (120), 15 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3882 transitions. [2025-01-09 14:50:23,560 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3882 transitions. Word has length 438 [2025-01-09 14:50:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:23,561 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3882 transitions. [2025-01-09 14:50:23,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3882 transitions. [2025-01-09 14:50:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:50:23,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:23,565 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:23,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 14:50:23,565 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:23,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1088807163, now seen corresponding path program 1 times [2025-01-09 14:50:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:23,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186049344] [2025-01-09 14:50:23,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:23,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:23,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:23,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:23,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:23,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186049344] [2025-01-09 14:50:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186049344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:23,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:23,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:50:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143076031] [2025-01-09 14:50:23,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:23,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:50:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:23,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:50:23,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:50:23,689 INFO L87 Difference]: Start difference. First operand 2511 states and 3882 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:23,844 INFO L93 Difference]: Finished difference Result 4608 states and 7059 transitions. [2025-01-09 14:50:23,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:50:23,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-01-09 14:50:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:23,850 INFO L225 Difference]: With dead ends: 4608 [2025-01-09 14:50:23,850 INFO L226 Difference]: Without dead ends: 2733 [2025-01-09 14:50:23,852 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:50:23,854 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 396 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:23,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1093 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:50:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-01-09 14:50:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2149. [2025-01-09 14:50:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2013 states have (on average 1.483358171882762) internal successors, (2986), 2013 states have internal predecessors, (2986), 120 states have call successors, (120), 15 states have call predecessors, (120), 15 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3226 transitions. [2025-01-09 14:50:23,928 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3226 transitions. Word has length 438 [2025-01-09 14:50:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:23,928 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3226 transitions. [2025-01-09 14:50:23,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3226 transitions. [2025-01-09 14:50:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:50:23,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:23,931 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:23,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 14:50:23,932 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:23,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash 289506522, now seen corresponding path program 1 times [2025-01-09 14:50:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:23,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711895428] [2025-01-09 14:50:23,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:23,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:24,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:24,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:24,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:24,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:24,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711895428] [2025-01-09 14:50:24,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711895428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:24,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:24,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:50:24,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502124497] [2025-01-09 14:50:24,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:24,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:50:24,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:24,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:50:24,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:24,421 INFO L87 Difference]: Start difference. First operand 2149 states and 3226 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:24,761 INFO L93 Difference]: Finished difference Result 4726 states and 7120 transitions. [2025-01-09 14:50:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:24,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-01-09 14:50:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:24,768 INFO L225 Difference]: With dead ends: 4726 [2025-01-09 14:50:24,768 INFO L226 Difference]: Without dead ends: 3217 [2025-01-09 14:50:24,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:50:24,771 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 739 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:24,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1280 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:50:24,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2025-01-09 14:50:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 2241. [2025-01-09 14:50:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 2105 states have (on average 1.482185273159145) internal successors, (3120), 2105 states have internal predecessors, (3120), 120 states have call successors, (120), 15 states have call predecessors, (120), 15 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3360 transitions. [2025-01-09 14:50:24,825 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3360 transitions. Word has length 438 [2025-01-09 14:50:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:24,825 INFO L471 AbstractCegarLoop]: Abstraction has 2241 states and 3360 transitions. [2025-01-09 14:50:24,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3360 transitions. [2025-01-09 14:50:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:50:24,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:24,828 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 14:50:24,828 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:24,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1823352131, now seen corresponding path program 1 times [2025-01-09 14:50:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:24,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673167109] [2025-01-09 14:50:24,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:24,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:24,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:25,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:25,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:25,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:25,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673167109] [2025-01-09 14:50:25,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673167109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:25,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:25,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:50:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981376128] [2025-01-09 14:50:25,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:25,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:50:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:25,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:50:25,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:25,617 INFO L87 Difference]: Start difference. First operand 2241 states and 3360 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:25,838 INFO L93 Difference]: Finished difference Result 3455 states and 5170 transitions. [2025-01-09 14:50:25,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:25,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-01-09 14:50:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:25,843 INFO L225 Difference]: With dead ends: 3455 [2025-01-09 14:50:25,843 INFO L226 Difference]: Without dead ends: 2066 [2025-01-09 14:50:25,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:25,846 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 631 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:25,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 940 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2025-01-09 14:50:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1807. [2025-01-09 14:50:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1671 states have (on average 1.4685816876122082) internal successors, (2454), 1671 states have internal predecessors, (2454), 120 states have call successors, (120), 15 states have call predecessors, (120), 15 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2694 transitions. [2025-01-09 14:50:25,899 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2694 transitions. Word has length 438 [2025-01-09 14:50:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:25,900 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2694 transitions. [2025-01-09 14:50:25,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2694 transitions. [2025-01-09 14:50:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:50:25,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:25,902 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:25,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 14:50:25,903 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:25,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1477363862, now seen corresponding path program 1 times [2025-01-09 14:50:25,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:25,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032249452] [2025-01-09 14:50:25,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:25,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:25,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:26,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:26,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:26,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:26,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032249452] [2025-01-09 14:50:26,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032249452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:26,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:26,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:50:26,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176790187] [2025-01-09 14:50:26,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:26,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:50:26,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:26,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:50:26,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:50:26,398 INFO L87 Difference]: Start difference. First operand 1807 states and 2694 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:26,866 INFO L93 Difference]: Finished difference Result 3590 states and 5337 transitions. [2025-01-09 14:50:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:50:26,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-01-09 14:50:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:26,871 INFO L225 Difference]: With dead ends: 3590 [2025-01-09 14:50:26,871 INFO L226 Difference]: Without dead ends: 2485 [2025-01-09 14:50:26,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:50:26,873 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 616 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:26,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2874 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:50:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-01-09 14:50:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 1963. [2025-01-09 14:50:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1827 states have (on average 1.4679802955665024) internal successors, (2682), 1827 states have internal predecessors, (2682), 120 states have call successors, (120), 15 states have call predecessors, (120), 15 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2922 transitions. [2025-01-09 14:50:26,930 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2922 transitions. Word has length 438 [2025-01-09 14:50:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:26,931 INFO L471 AbstractCegarLoop]: Abstraction has 1963 states and 2922 transitions. [2025-01-09 14:50:26,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2922 transitions. [2025-01-09 14:50:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-09 14:50:26,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:26,933 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:26,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 14:50:26,934 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:26,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash -572023980, now seen corresponding path program 1 times [2025-01-09 14:50:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:26,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504402659] [2025-01-09 14:50:26,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:26,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:27,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:27,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:27,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 39 proven. 138 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:50:27,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504402659] [2025-01-09 14:50:27,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504402659] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609983003] [2025-01-09 14:50:27,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:27,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:27,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:27,740 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:50:27,741 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:50:28,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-09 14:50:28,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-09 14:50:28,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:28,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:28,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:50:28,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3557 proven. 78 refuted. 0 times theorem prover too weak. 3445 trivial. 0 not checked. [2025-01-09 14:50:28,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 99 proven. 78 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:50:28,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609983003] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:28,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:28,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-01-09 14:50:28,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879516182] [2025-01-09 14:50:28,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:28,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:50:28,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:28,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:50:28,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:50:28,647 INFO L87 Difference]: Start difference. First operand 1963 states and 2922 transitions. Second operand has 13 states, 13 states have (on average 21.615384615384617) internal successors, (281), 13 states have internal predecessors, (281), 4 states have call successors, (132), 2 states have call predecessors, (132), 4 states have return successors, (134), 4 states have call predecessors, (134), 4 states have call successors, (134) [2025-01-09 14:50:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:29,269 INFO L93 Difference]: Finished difference Result 3277 states and 4851 transitions. [2025-01-09 14:50:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:50:29,269 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.615384615384617) internal successors, (281), 13 states have internal predecessors, (281), 4 states have call successors, (132), 2 states have call predecessors, (132), 4 states have return successors, (134), 4 states have call predecessors, (134), 4 states have call successors, (134) Word has length 438 [2025-01-09 14:50:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:29,272 INFO L225 Difference]: With dead ends: 3277 [2025-01-09 14:50:29,272 INFO L226 Difference]: Without dead ends: 1539 [2025-01-09 14:50:29,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 895 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2025-01-09 14:50:29,274 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 979 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:29,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1397 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:50:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2025-01-09 14:50:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1517. [2025-01-09 14:50:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1375 states have (on average 1.4312727272727273) internal successors, (1968), 1375 states have internal predecessors, (1968), 120 states have call successors, (120), 21 states have call predecessors, (120), 21 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2208 transitions. [2025-01-09 14:50:29,324 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2208 transitions. Word has length 438 [2025-01-09 14:50:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:29,324 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2208 transitions. [2025-01-09 14:50:29,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.615384615384617) internal successors, (281), 13 states have internal predecessors, (281), 4 states have call successors, (132), 2 states have call predecessors, (132), 4 states have return successors, (134), 4 states have call predecessors, (134), 4 states have call successors, (134) [2025-01-09 14:50:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2208 transitions. [2025-01-09 14:50:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-01-09 14:50:29,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:29,327 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:29,338 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:50:29,531 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,SelfDestructingSolverStorable25 [2025-01-09 14:50:29,536 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:29,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:29,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1016135777, now seen corresponding path program 1 times [2025-01-09 14:50:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088613566] [2025-01-09 14:50:29,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:29,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-09 14:50:29,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-09 14:50:29,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:29,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:30,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088613566] [2025-01-09 14:50:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088613566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:50:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430902312] [2025-01-09 14:50:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:50:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:30,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:50:30,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:50:30,120 INFO L87 Difference]: Start difference. First operand 1517 states and 2208 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:30,364 INFO L93 Difference]: Finished difference Result 2230 states and 3249 transitions. [2025-01-09 14:50:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:50:30,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-01-09 14:50:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:30,370 INFO L225 Difference]: With dead ends: 2230 [2025-01-09 14:50:30,370 INFO L226 Difference]: Without dead ends: 931 [2025-01-09 14:50:30,376 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:50:30,376 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 651 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:30,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 980 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-01-09 14:50:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 931. [2025-01-09 14:50:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 789 states have (on average 1.3802281368821292) internal successors, (1089), 789 states have internal predecessors, (1089), 120 states have call successors, (120), 21 states have call predecessors, (120), 21 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1329 transitions. [2025-01-09 14:50:30,475 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1329 transitions. Word has length 439 [2025-01-09 14:50:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:30,476 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1329 transitions. [2025-01-09 14:50:30,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1329 transitions. [2025-01-09 14:50:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-01-09 14:50:30,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:30,477 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:30,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 14:50:30,478 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:30,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash -934080437, now seen corresponding path program 1 times [2025-01-09 14:50:30,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:30,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242325968] [2025-01-09 14:50:30,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:30,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:30,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-09 14:50:30,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-09 14:50:30,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:30,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:50:31,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:31,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242325968] [2025-01-09 14:50:31,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242325968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:50:31,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:50:31,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:50:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997081255] [2025-01-09 14:50:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:50:31,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:50:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:31,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:50:31,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:50:31,340 INFO L87 Difference]: Start difference. First operand 931 states and 1329 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:31,668 INFO L93 Difference]: Finished difference Result 1895 states and 2730 transitions. [2025-01-09 14:50:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:50:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-01-09 14:50:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:31,671 INFO L225 Difference]: With dead ends: 1895 [2025-01-09 14:50:31,671 INFO L226 Difference]: Without dead ends: 1285 [2025-01-09 14:50:31,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:50:31,672 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 925 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:31,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1315 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:31,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-01-09 14:50:31,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 931. [2025-01-09 14:50:31,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 789 states have (on average 1.3802281368821292) internal successors, (1089), 789 states have internal predecessors, (1089), 120 states have call successors, (120), 21 states have call predecessors, (120), 21 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1329 transitions. [2025-01-09 14:50:31,720 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1329 transitions. Word has length 439 [2025-01-09 14:50:31,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:31,721 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1329 transitions. [2025-01-09 14:50:31,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:50:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1329 transitions. [2025-01-09 14:50:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-01-09 14:50:31,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:31,723 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:31,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 14:50:31,723 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:31,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1005081609, now seen corresponding path program 1 times [2025-01-09 14:50:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:31,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473904081] [2025-01-09 14:50:31,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:31,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:31,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-09 14:50:32,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-09 14:50:32,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:32,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 30 proven. 147 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:50:32,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:50:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473904081] [2025-01-09 14:50:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473904081] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:50:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752891821] [2025-01-09 14:50:32,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:32,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:50:32,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:50:32,720 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:50:32,727 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:50:33,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-09 14:50:33,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-09 14:50:33,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:33,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:50:33,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:50:33,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:50:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 2039 proven. 147 refuted. 0 times theorem prover too weak. 4894 trivial. 0 not checked. [2025-01-09 14:50:33,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:50:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 30 proven. 147 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:50:33,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752891821] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:50:33,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:50:33,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:50:33,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547172972] [2025-01-09 14:50:33,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:50:33,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:50:33,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:50:33,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:50:33,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:50:33,971 INFO L87 Difference]: Start difference. First operand 931 states and 1329 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-01-09 14:50:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:50:34,252 INFO L93 Difference]: Finished difference Result 1317 states and 1856 transitions. [2025-01-09 14:50:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:50:34,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) Word has length 439 [2025-01-09 14:50:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:50:34,255 INFO L225 Difference]: With dead ends: 1317 [2025-01-09 14:50:34,255 INFO L226 Difference]: Without dead ends: 687 [2025-01-09 14:50:34,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 875 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:50:34,256 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 214 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:50:34,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 860 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:50:34,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-01-09 14:50:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 635. [2025-01-09 14:50:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 492 states have (on average 1.3211382113821137) internal successors, (650), 492 states have internal predecessors, (650), 120 states have call successors, (120), 22 states have call predecessors, (120), 22 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 14:50:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 890 transitions. [2025-01-09 14:50:34,305 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 890 transitions. Word has length 439 [2025-01-09 14:50:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:50:34,305 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 890 transitions. [2025-01-09 14:50:34,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-01-09 14:50:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 890 transitions. [2025-01-09 14:50:34,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-01-09 14:50:34,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:50:34,307 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:34,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:50:34,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 14:50:34,511 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:50:34,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:50:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1375246741, now seen corresponding path program 1 times [2025-01-09 14:50:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:50:34,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995241716] [2025-01-09 14:50:34,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:50:34,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:50:34,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-01-09 14:50:34,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-01-09 14:50:34,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:50:34,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat