./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.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_loopvsstraightlinecode_100-1loop_file-20.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 d7483f4c602f1d80c3d31837b57d86164e65df5e6fa201344a2b0a8f22740044 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:50:19,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:50:19,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:50:19,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:50:19,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:50:19,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:50:19,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:50:19,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:50:19,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:50:19,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:50:19,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:50:19,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:50:19,795 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:50:19,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:50:19,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:50:19,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:50:19,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:50:19,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:50:19,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:50:19,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:50:19,797 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 -> d7483f4c602f1d80c3d31837b57d86164e65df5e6fa201344a2b0a8f22740044 [2025-01-09 12:50:19,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:50:20,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:50:20,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:50:20,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:50:20,009 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:50:20,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-01-09 12:50:21,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b814289a6/63eb1d61925b40a1bc14f7652ba61e48/FLAGfafee7a2e [2025-01-09 12:50:21,446 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:50:21,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-01-09 12:50:21,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b814289a6/63eb1d61925b40a1bc14f7652ba61e48/FLAGfafee7a2e [2025-01-09 12:50:21,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b814289a6/63eb1d61925b40a1bc14f7652ba61e48 [2025-01-09 12:50:21,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:50:21,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:50:21,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:50:21,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:50:21,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:50:21,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:21,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21, skipping insertion in model container [2025-01-09 12:50:21,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:21,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:50:21,852 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_loopvsstraightlinecode_100-1loop_file-20.i[916,929] [2025-01-09 12:50:21,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:50:21,917 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:50:21,925 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_loopvsstraightlinecode_100-1loop_file-20.i[916,929] [2025-01-09 12:50:21,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:50:21,963 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:50:21,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21 WrapperNode [2025-01-09 12:50:21,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:50:21,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:50:21,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:50:21,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:50:21,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:21,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,003 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-01-09 12:50:22,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:50:22,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:50:22,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:50:22,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:50:22,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,028 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 12:50:22,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,044 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:50:22,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:50:22,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:50:22,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:50:22,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (1/1) ... [2025-01-09 12:50:22,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:50:22,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:22,085 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 12:50:22,091 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 12:50:22,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:50:22,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:50:22,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:50:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:50:22,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:50:22,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:50:22,194 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:50:22,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:50:22,678 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-01-09 12:50:22,678 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:50:22,689 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:50:22,689 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:50:22,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:22 BoogieIcfgContainer [2025-01-09 12:50:22,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:50:22,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:50:22,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:50:22,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:50:22,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:50:21" (1/3) ... [2025-01-09 12:50:22,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bbf8084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:50:22, skipping insertion in model container [2025-01-09 12:50:22,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:50:21" (2/3) ... [2025-01-09 12:50:22,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bbf8084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:50:22, skipping insertion in model container [2025-01-09 12:50:22,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:50:22" (3/3) ... [2025-01-09 12:50:22,699 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-01-09 12:50:22,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:50:22,711 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-20.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:50:22,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:50:22,781 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;@57f93dfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:50:22,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:50:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 12:50:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 12:50:22,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:22,796 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:22,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:22,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:22,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1564344916, now seen corresponding path program 1 times [2025-01-09 12:50:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:22,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118964335] [2025-01-09 12:50:22,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:22,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 12:50:22,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 12:50:22,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:22,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 12:50:23,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:23,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118964335] [2025-01-09 12:50:23,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118964335] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:50:23,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565381216] [2025-01-09 12:50:23,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:23,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:23,043 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 12:50:23,044 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 12:50:23,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 12:50:23,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 12:50:23,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:23,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:23,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:50:23,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 12:50:23,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:50:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565381216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:50:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:50:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601921998] [2025-01-09 12:50:23,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:23,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:50:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:23,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:50:23,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:50:23,305 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:50:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:23,332 INFO L93 Difference]: Finished difference Result 227 states and 384 transitions. [2025-01-09 12:50:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:50:23,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 204 [2025-01-09 12:50:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:23,340 INFO L225 Difference]: With dead ends: 227 [2025-01-09 12:50:23,341 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 12:50:23,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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 12:50:23,346 INFO L435 NwaCegarLoop]: 176 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, 176 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 12:50:23,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:50:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 12:50:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 12:50:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 12:50:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-01-09 12:50:23,378 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 204 [2025-01-09 12:50:23,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:23,378 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-01-09 12:50:23,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:50:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-01-09 12:50:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 12:50:23,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:23,382 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:23,389 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 12:50:23,586 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 12:50:23,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:23,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:23,587 INFO L85 PathProgramCache]: Analyzing trace with hash -75186854, now seen corresponding path program 1 times [2025-01-09 12:50:23,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:23,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091395509] [2025-01-09 12:50:23,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:23,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:23,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 12:50:23,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 12:50:23,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:23,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:24,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:24,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091395509] [2025-01-09 12:50:24,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091395509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:24,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:24,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:50:24,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968582837] [2025-01-09 12:50:24,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:24,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:50:24,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:24,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:50:24,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:50:24,129 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:24,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:24,377 INFO L93 Difference]: Finished difference Result 364 states and 565 transitions. [2025-01-09 12:50:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:50:24,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-01-09 12:50:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:24,380 INFO L225 Difference]: With dead ends: 364 [2025-01-09 12:50:24,381 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 12:50:24,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:50:24,384 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 173 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:24,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 729 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:50:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 12:50:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2025-01-09 12:50:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 179 states have internal predecessors, (251), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 12:50:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 375 transitions. [2025-01-09 12:50:24,407 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 375 transitions. Word has length 204 [2025-01-09 12:50:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:24,408 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 375 transitions. [2025-01-09 12:50:24,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 375 transitions. [2025-01-09 12:50:24,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 12:50:24,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:24,410 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:24,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:50:24,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:24,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1240533979, now seen corresponding path program 1 times [2025-01-09 12:50:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:24,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637246064] [2025-01-09 12:50:24,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:24,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:24,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:50:24,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:50:24,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:24,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:25,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:25,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637246064] [2025-01-09 12:50:25,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637246064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:25,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:25,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:50:25,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478239936] [2025-01-09 12:50:25,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:25,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:50:25,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:25,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:50:25,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:50:25,051 INFO L87 Difference]: Start difference. First operand 244 states and 375 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:25,599 INFO L93 Difference]: Finished difference Result 823 states and 1254 transitions. [2025-01-09 12:50:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:50:25,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-01-09 12:50:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:25,606 INFO L225 Difference]: With dead ends: 823 [2025-01-09 12:50:25,607 INFO L226 Difference]: Without dead ends: 582 [2025-01-09 12:50:25,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:50:25,610 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 255 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:25,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 835 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:50:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-09 12:50:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 428. [2025-01-09 12:50:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 349 states have (on average 1.4269340974212035) internal successors, (498), 351 states have internal predecessors, (498), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 12:50:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 646 transitions. [2025-01-09 12:50:25,682 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 646 transitions. Word has length 205 [2025-01-09 12:50:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:25,683 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 646 transitions. [2025-01-09 12:50:25,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 646 transitions. [2025-01-09 12:50:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 12:50:25,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:25,689 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:25,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:50:25,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:25,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2138237765, now seen corresponding path program 1 times [2025-01-09 12:50:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:25,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297466777] [2025-01-09 12:50:25,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:25,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 12:50:25,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 12:50:25,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:25,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:27,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:27,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297466777] [2025-01-09 12:50:27,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297466777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:27,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:27,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 12:50:27,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614373712] [2025-01-09 12:50:27,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:27,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 12:50:27,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:27,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 12:50:27,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:50:27,111 INFO L87 Difference]: Start difference. First operand 428 states and 646 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:27,580 INFO L93 Difference]: Finished difference Result 1357 states and 2026 transitions. [2025-01-09 12:50:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:50:27,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 12:50:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:27,586 INFO L225 Difference]: With dead ends: 1357 [2025-01-09 12:50:27,586 INFO L226 Difference]: Without dead ends: 932 [2025-01-09 12:50:27,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:50:27,588 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 503 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:27,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 410 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:50:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-01-09 12:50:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 539. [2025-01-09 12:50:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 460 states have (on average 1.458695652173913) internal successors, (671), 462 states have internal predecessors, (671), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 12:50:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 819 transitions. [2025-01-09 12:50:27,628 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 819 transitions. Word has length 206 [2025-01-09 12:50:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:27,629 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 819 transitions. [2025-01-09 12:50:27,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 819 transitions. [2025-01-09 12:50:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 12:50:27,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:27,634 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:27,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:50:27,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:27,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:27,635 INFO L85 PathProgramCache]: Analyzing trace with hash 858374087, now seen corresponding path program 1 times [2025-01-09 12:50:27,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:27,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626005414] [2025-01-09 12:50:27,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:27,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 12:50:27,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 12:50:27,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:27,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:28,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:28,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626005414] [2025-01-09 12:50:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626005414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:50:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812690907] [2025-01-09 12:50:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:28,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:50:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:28,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:50:28,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:50:28,950 INFO L87 Difference]: Start difference. First operand 539 states and 819 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:29,657 INFO L93 Difference]: Finished difference Result 1387 states and 2088 transitions. [2025-01-09 12:50:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:50:29,658 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 12:50:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:29,662 INFO L225 Difference]: With dead ends: 1387 [2025-01-09 12:50:29,662 INFO L226 Difference]: Without dead ends: 851 [2025-01-09 12:50:29,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:50:29,665 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 371 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:29,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 602 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:50:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-01-09 12:50:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 538. [2025-01-09 12:50:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 459 states have (on average 1.457516339869281) internal successors, (669), 461 states have internal predecessors, (669), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 12:50:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 817 transitions. [2025-01-09 12:50:29,704 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 817 transitions. Word has length 206 [2025-01-09 12:50:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:29,704 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 817 transitions. [2025-01-09 12:50:29,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 817 transitions. [2025-01-09 12:50:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 12:50:29,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:29,707 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:29,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:50:29,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:29,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash 449294023, now seen corresponding path program 1 times [2025-01-09 12:50:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460609919] [2025-01-09 12:50:29,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:29,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 12:50:29,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 12:50:29,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:29,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:31,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460609919] [2025-01-09 12:50:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460609919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:31,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:31,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:50:31,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443907921] [2025-01-09 12:50:31,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:31,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:50:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:31,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:50:31,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:50:31,196 INFO L87 Difference]: Start difference. First operand 538 states and 817 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:32,213 INFO L93 Difference]: Finished difference Result 1421 states and 2110 transitions. [2025-01-09 12:50:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:50:32,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 12:50:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:32,219 INFO L225 Difference]: With dead ends: 1421 [2025-01-09 12:50:32,219 INFO L226 Difference]: Without dead ends: 886 [2025-01-09 12:50:32,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:50:32,222 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 265 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:32,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 770 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:50:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-01-09 12:50:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 559. [2025-01-09 12:50:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 480 states have (on average 1.4520833333333334) internal successors, (697), 482 states have internal predecessors, (697), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 12:50:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 845 transitions. [2025-01-09 12:50:32,259 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 845 transitions. Word has length 206 [2025-01-09 12:50:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:32,260 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 845 transitions. [2025-01-09 12:50:32,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 845 transitions. [2025-01-09 12:50:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 12:50:32,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:32,264 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:32,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:50:32,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:32,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:32,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1776388455, now seen corresponding path program 1 times [2025-01-09 12:50:32,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:32,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322370778] [2025-01-09 12:50:32,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:32,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:32,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 12:50:32,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 12:50:32,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:32,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:32,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:32,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322370778] [2025-01-09 12:50:32,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322370778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:32,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:32,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:50:32,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761301757] [2025-01-09 12:50:32,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:32,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:50:32,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:32,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:50:32,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:50:32,358 INFO L87 Difference]: Start difference. First operand 559 states and 845 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:32,473 INFO L93 Difference]: Finished difference Result 1381 states and 2097 transitions. [2025-01-09 12:50:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:50:32,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 12:50:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:32,477 INFO L225 Difference]: With dead ends: 1381 [2025-01-09 12:50:32,477 INFO L226 Difference]: Without dead ends: 825 [2025-01-09 12:50:32,478 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 12:50:32,479 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 147 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:32,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 456 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:50:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-01-09 12:50:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 678. [2025-01-09 12:50:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 599 states have (on average 1.4707846410684473) internal successors, (881), 601 states have internal predecessors, (881), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 12:50:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1029 transitions. [2025-01-09 12:50:32,517 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1029 transitions. Word has length 206 [2025-01-09 12:50:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1029 transitions. [2025-01-09 12:50:32,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1029 transitions. [2025-01-09 12:50:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 12:50:32,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:32,522 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:32,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:50:32,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:32,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:32,523 INFO L85 PathProgramCache]: Analyzing trace with hash -918871778, now seen corresponding path program 1 times [2025-01-09 12:50:32,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:32,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022671407] [2025-01-09 12:50:32,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:32,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:32,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 12:50:32,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 12:50:32,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:32,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:32,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:32,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022671407] [2025-01-09 12:50:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022671407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:32,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:32,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:50:32,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574094323] [2025-01-09 12:50:32,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:32,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:50:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:32,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:50:32,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:50:32,707 INFO L87 Difference]: Start difference. First operand 678 states and 1029 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:32,925 INFO L93 Difference]: Finished difference Result 1625 states and 2474 transitions. [2025-01-09 12:50:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:50:32,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-01-09 12:50:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:32,934 INFO L225 Difference]: With dead ends: 1625 [2025-01-09 12:50:32,934 INFO L226 Difference]: Without dead ends: 950 [2025-01-09 12:50:32,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:50:32,935 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 152 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:32,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 657 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:50:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-01-09 12:50:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 706. [2025-01-09 12:50:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 627 states have (on average 1.467304625199362) internal successors, (920), 629 states have internal predecessors, (920), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 12:50:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1068 transitions. [2025-01-09 12:50:32,970 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1068 transitions. Word has length 207 [2025-01-09 12:50:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:32,970 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1068 transitions. [2025-01-09 12:50:32,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1068 transitions. [2025-01-09 12:50:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 12:50:32,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:32,974 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:32,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:50:32,975 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:32,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1984044928, now seen corresponding path program 1 times [2025-01-09 12:50:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:32,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217130841] [2025-01-09 12:50:32,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:32,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:32,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:50:33,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:50:33,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:33,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 12:50:33,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:33,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217130841] [2025-01-09 12:50:33,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217130841] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:50:33,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471364923] [2025-01-09 12:50:33,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:33,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:33,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:33,498 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 12:50:33,500 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 12:50:33,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:50:33,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:50:33,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:33,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:33,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 12:50:33,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 482 proven. 150 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2025-01-09 12:50:34,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:50:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 12:50:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471364923] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:50:34,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:50:34,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 28 [2025-01-09 12:50:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423293247] [2025-01-09 12:50:34,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:50:34,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 12:50:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:34,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 12:50:34,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2025-01-09 12:50:34,907 INFO L87 Difference]: Start difference. First operand 706 states and 1068 transitions. Second operand has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 4 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) [2025-01-09 12:50:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:37,422 INFO L93 Difference]: Finished difference Result 1911 states and 2768 transitions. [2025-01-09 12:50:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-09 12:50:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 4 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) Word has length 208 [2025-01-09 12:50:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:37,432 INFO L225 Difference]: With dead ends: 1911 [2025-01-09 12:50:37,432 INFO L226 Difference]: Without dead ends: 1208 [2025-01-09 12:50:37,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1056, Invalid=4346, Unknown=0, NotChecked=0, Total=5402 [2025-01-09 12:50:37,439 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1208 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:37,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 1507 Invalid, 2307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 12:50:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2025-01-09 12:50:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 799. [2025-01-09 12:50:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 690 states have (on average 1.4376811594202898) internal successors, (992), 694 states have internal predecessors, (992), 90 states have call successors, (90), 18 states have call predecessors, (90), 18 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 12:50:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1172 transitions. [2025-01-09 12:50:37,487 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1172 transitions. Word has length 208 [2025-01-09 12:50:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:37,488 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1172 transitions. [2025-01-09 12:50:37,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 4 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 4 states have call predecessors, (84), 4 states have call successors, (84) [2025-01-09 12:50:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1172 transitions. [2025-01-09 12:50:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 12:50:37,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:37,490 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:37,497 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 12:50:37,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:37,691 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:37,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1561343102, now seen corresponding path program 1 times [2025-01-09 12:50:37,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:37,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003429023] [2025-01-09 12:50:37,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:37,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:37,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:50:55,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:50:55,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:55,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 12:50:55,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:55,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003429023] [2025-01-09 12:50:55,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003429023] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:50:55,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125134830] [2025-01-09 12:50:55,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:55,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:55,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:50:55,417 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 12:50:55,418 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 12:50:55,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:50:55,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:50:55,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:55,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:55,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 12:50:55,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:50:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 872 proven. 114 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-01-09 12:50:56,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:50:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 12:50:56,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125134830] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:50:56,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:50:56,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 19 [2025-01-09 12:50:56,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615875593] [2025-01-09 12:50:56,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:50:56,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 12:50:56,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:56,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 12:50:56,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-01-09 12:50:56,577 INFO L87 Difference]: Start difference. First operand 799 states and 1172 transitions. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 18 states have internal predecessors, (116), 6 states have call successors, (82), 4 states have call predecessors, (82), 7 states have return successors, (83), 6 states have call predecessors, (83), 6 states have call successors, (83) [2025-01-09 12:50:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:57,957 INFO L93 Difference]: Finished difference Result 1639 states and 2369 transitions. [2025-01-09 12:50:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 12:50:57,958 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 18 states have internal predecessors, (116), 6 states have call successors, (82), 4 states have call predecessors, (82), 7 states have return successors, (83), 6 states have call predecessors, (83), 6 states have call successors, (83) Word has length 208 [2025-01-09 12:50:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:57,961 INFO L225 Difference]: With dead ends: 1639 [2025-01-09 12:50:57,962 INFO L226 Difference]: Without dead ends: 850 [2025-01-09 12:50:57,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=529, Invalid=1921, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 12:50:57,964 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 508 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:57,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1100 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:50:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-09 12:50:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 638. [2025-01-09 12:50:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 508 states have (on average 1.3681102362204725) internal successors, (695), 510 states have internal predecessors, (695), 107 states have call successors, (107), 22 states have call predecessors, (107), 22 states have return successors, (107), 105 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 12:50:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 909 transitions. [2025-01-09 12:50:58,010 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 909 transitions. Word has length 208 [2025-01-09 12:50:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:58,010 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 909 transitions. [2025-01-09 12:50:58,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 18 states have internal predecessors, (116), 6 states have call successors, (82), 4 states have call predecessors, (82), 7 states have return successors, (83), 6 states have call predecessors, (83), 6 states have call successors, (83) [2025-01-09 12:50:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 909 transitions. [2025-01-09 12:50:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 12:50:58,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:58,012 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:58,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 12:50:58,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:50:58,213 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:58,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2042319300, now seen corresponding path program 1 times [2025-01-09 12:50:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395044227] [2025-01-09 12:50:58,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:58,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:50:58,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:50:58,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:58,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:59,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395044227] [2025-01-09 12:50:59,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395044227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:59,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:59,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:50:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400994395] [2025-01-09 12:50:59,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:59,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:50:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:59,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:50:59,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:50:59,929 INFO L87 Difference]: Start difference. First operand 638 states and 909 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:02,026 INFO L93 Difference]: Finished difference Result 1509 states and 2104 transitions. [2025-01-09 12:51:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:51:02,027 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-01-09 12:51:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:02,036 INFO L225 Difference]: With dead ends: 1509 [2025-01-09 12:51:02,037 INFO L226 Difference]: Without dead ends: 1172 [2025-01-09 12:51:02,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-01-09 12:51:02,038 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 690 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:02,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1194 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:51:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-01-09 12:51:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 665. [2025-01-09 12:51:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 534 states have (on average 1.3689138576779025) internal successors, (731), 536 states have internal predecessors, (731), 107 states have call successors, (107), 23 states have call predecessors, (107), 23 states have return successors, (107), 105 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 12:51:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 945 transitions. [2025-01-09 12:51:02,112 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 945 transitions. Word has length 208 [2025-01-09 12:51:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:02,113 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 945 transitions. [2025-01-09 12:51:02,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 945 transitions. [2025-01-09 12:51:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 12:51:02,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:02,114 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:02,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:51:02,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:02,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1241530746, now seen corresponding path program 1 times [2025-01-09 12:51:02,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:02,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082760522] [2025-01-09 12:51:02,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:02,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:02,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 12:51:02,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 12:51:02,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:02,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:03,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:03,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082760522] [2025-01-09 12:51:03,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082760522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:03,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:03,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:51:03,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130752913] [2025-01-09 12:51:03,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:03,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:51:03,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:03,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:51:03,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:51:03,077 INFO L87 Difference]: Start difference. First operand 665 states and 945 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:04,055 INFO L93 Difference]: Finished difference Result 1498 states and 2124 transitions. [2025-01-09 12:51:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:51:04,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-01-09 12:51:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:04,063 INFO L225 Difference]: With dead ends: 1498 [2025-01-09 12:51:04,063 INFO L226 Difference]: Without dead ends: 975 [2025-01-09 12:51:04,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:51:04,065 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 155 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:04,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 878 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:51:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-01-09 12:51:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 644. [2025-01-09 12:51:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 513 states have (on average 1.3489278752436646) internal successors, (692), 515 states have internal predecessors, (692), 107 states have call successors, (107), 23 states have call predecessors, (107), 23 states have return successors, (107), 105 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 12:51:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 906 transitions. [2025-01-09 12:51:04,120 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 906 transitions. Word has length 208 [2025-01-09 12:51:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:04,121 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 906 transitions. [2025-01-09 12:51:04,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 906 transitions. [2025-01-09 12:51:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 12:51:04,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:04,122 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:04,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:51:04,122 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:04,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:04,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1167237990, now seen corresponding path program 1 times [2025-01-09 12:51:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883564638] [2025-01-09 12:51:04,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:04,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:04,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 12:51:08,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 12:51:08,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:08,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:09,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:09,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883564638] [2025-01-09 12:51:09,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883564638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:09,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:09,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:51:09,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620917398] [2025-01-09 12:51:09,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:09,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:51:09,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:09,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:51:09,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:51:09,926 INFO L87 Difference]: Start difference. First operand 644 states and 906 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:10,634 INFO L93 Difference]: Finished difference Result 1473 states and 2093 transitions. [2025-01-09 12:51:10,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:51:10,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 12:51:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:10,639 INFO L225 Difference]: With dead ends: 1473 [2025-01-09 12:51:10,639 INFO L226 Difference]: Without dead ends: 998 [2025-01-09 12:51:10,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:51:10,640 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 461 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:10,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 519 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:51:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-01-09 12:51:10,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 651. [2025-01-09 12:51:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 520 states have (on average 1.35) internal successors, (702), 522 states have internal predecessors, (702), 107 states have call successors, (107), 23 states have call predecessors, (107), 23 states have return successors, (107), 105 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 12:51:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 916 transitions. [2025-01-09 12:51:10,744 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 916 transitions. Word has length 210 [2025-01-09 12:51:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:10,745 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 916 transitions. [2025-01-09 12:51:10,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 916 transitions. [2025-01-09 12:51:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 12:51:10,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:10,746 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:10,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:51:10,746 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:10,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:10,747 INFO L85 PathProgramCache]: Analyzing trace with hash 156120740, now seen corresponding path program 1 times [2025-01-09 12:51:10,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:10,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957660625] [2025-01-09 12:51:10,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:10,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:10,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 12:51:10,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 12:51:10,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:10,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:12,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957660625] [2025-01-09 12:51:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957660625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:12,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:12,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:51:12,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260155976] [2025-01-09 12:51:12,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:12,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:51:12,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:12,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:51:12,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:51:12,782 INFO L87 Difference]: Start difference. First operand 651 states and 916 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:15,487 INFO L93 Difference]: Finished difference Result 1482 states and 2096 transitions. [2025-01-09 12:51:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 12:51:15,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 12:51:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:15,499 INFO L225 Difference]: With dead ends: 1482 [2025-01-09 12:51:15,500 INFO L226 Difference]: Without dead ends: 1000 [2025-01-09 12:51:15,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2025-01-09 12:51:15,501 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 552 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:15,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1113 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 12:51:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-01-09 12:51:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 683. [2025-01-09 12:51:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 552 states have (on average 1.3659420289855073) internal successors, (754), 554 states have internal predecessors, (754), 107 states have call successors, (107), 23 states have call predecessors, (107), 23 states have return successors, (107), 105 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 12:51:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 968 transitions. [2025-01-09 12:51:15,575 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 968 transitions. Word has length 210 [2025-01-09 12:51:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:15,575 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 968 transitions. [2025-01-09 12:51:15,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 968 transitions. [2025-01-09 12:51:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 12:51:15,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:15,578 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:15,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:51:15,578 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:15,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:15,579 INFO L85 PathProgramCache]: Analyzing trace with hash -864947614, now seen corresponding path program 1 times [2025-01-09 12:51:15,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:15,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938140911] [2025-01-09 12:51:15,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:15,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:15,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 12:51:15,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 12:51:15,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:15,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:16,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:16,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938140911] [2025-01-09 12:51:16,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938140911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:16,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:16,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:51:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823946591] [2025-01-09 12:51:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:16,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:51:16,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:16,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:51:16,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:51:16,042 INFO L87 Difference]: Start difference. First operand 683 states and 968 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 12:51:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:16,550 INFO L93 Difference]: Finished difference Result 1989 states and 2792 transitions. [2025-01-09 12:51:16,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:51:16,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 210 [2025-01-09 12:51:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:16,557 INFO L225 Difference]: With dead ends: 1989 [2025-01-09 12:51:16,558 INFO L226 Difference]: Without dead ends: 1426 [2025-01-09 12:51:16,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:51:16,559 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 360 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:16,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 715 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:51:16,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2025-01-09 12:51:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1222. [2025-01-09 12:51:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 999 states have (on average 1.3633633633633633) internal successors, (1362), 1003 states have internal predecessors, (1362), 183 states have call successors, (183), 39 states have call predecessors, (183), 39 states have return successors, (183), 179 states have call predecessors, (183), 183 states have call successors, (183) [2025-01-09 12:51:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1728 transitions. [2025-01-09 12:51:16,676 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1728 transitions. Word has length 210 [2025-01-09 12:51:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:16,677 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1728 transitions. [2025-01-09 12:51:16,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 12:51:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1728 transitions. [2025-01-09 12:51:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 12:51:16,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:16,678 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:16,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:51:16,678 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:16,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash -521705752, now seen corresponding path program 1 times [2025-01-09 12:51:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:16,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911448793] [2025-01-09 12:51:16,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:16,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 12:51:16,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 12:51:16,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:16,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:19,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911448793] [2025-01-09 12:51:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911448793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:19,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:51:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406309853] [2025-01-09 12:51:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:19,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:51:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:19,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:51:19,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:51:19,179 INFO L87 Difference]: Start difference. First operand 1222 states and 1728 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:21,168 INFO L93 Difference]: Finished difference Result 2521 states and 3581 transitions. [2025-01-09 12:51:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:51:21,169 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 210 [2025-01-09 12:51:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:21,174 INFO L225 Difference]: With dead ends: 2521 [2025-01-09 12:51:21,175 INFO L226 Difference]: Without dead ends: 1715 [2025-01-09 12:51:21,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-01-09 12:51:21,176 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 628 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:21,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1133 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:51:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-01-09 12:51:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1202. [2025-01-09 12:51:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 979 states have (on average 1.3585291113381002) internal successors, (1330), 983 states have internal predecessors, (1330), 183 states have call successors, (183), 39 states have call predecessors, (183), 39 states have return successors, (183), 179 states have call predecessors, (183), 183 states have call successors, (183) [2025-01-09 12:51:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1696 transitions. [2025-01-09 12:51:21,290 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1696 transitions. Word has length 210 [2025-01-09 12:51:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:21,290 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1696 transitions. [2025-01-09 12:51:21,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1696 transitions. [2025-01-09 12:51:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 12:51:21,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:21,292 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:21,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 12:51:21,292 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:21,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1468716904, now seen corresponding path program 1 times [2025-01-09 12:51:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:21,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737955631] [2025-01-09 12:51:21,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:21,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:21,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:51:21,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:51:21,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:21,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:21,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:21,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737955631] [2025-01-09 12:51:21,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737955631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:21,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:21,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:51:21,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46227665] [2025-01-09 12:51:21,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:21,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:51:21,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:21,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:51:21,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:51:21,553 INFO L87 Difference]: Start difference. First operand 1202 states and 1696 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:51:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:22,224 INFO L93 Difference]: Finished difference Result 3584 states and 5026 transitions. [2025-01-09 12:51:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:51:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 212 [2025-01-09 12:51:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:22,233 INFO L225 Difference]: With dead ends: 3584 [2025-01-09 12:51:22,233 INFO L226 Difference]: Without dead ends: 2516 [2025-01-09 12:51:22,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:51:22,236 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 542 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:22,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 825 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:51:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2025-01-09 12:51:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 1906. [2025-01-09 12:51:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1591 states have (on average 1.3840351979886865) internal successors, (2202), 1597 states have internal predecessors, (2202), 259 states have call successors, (259), 55 states have call predecessors, (259), 55 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259) [2025-01-09 12:51:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2720 transitions. [2025-01-09 12:51:22,433 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2720 transitions. Word has length 212 [2025-01-09 12:51:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:22,434 INFO L471 AbstractCegarLoop]: Abstraction has 1906 states and 2720 transitions. [2025-01-09 12:51:22,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:51:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2720 transitions. [2025-01-09 12:51:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 12:51:22,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:22,435 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:22,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 12:51:22,436 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:22,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:22,436 INFO L85 PathProgramCache]: Analyzing trace with hash -788658534, now seen corresponding path program 1 times [2025-01-09 12:51:22,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:22,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966557774] [2025-01-09 12:51:22,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:22,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:22,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:51:22,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:51:22,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:22,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966557774] [2025-01-09 12:51:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966557774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:24,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:24,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:51:24,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028677389] [2025-01-09 12:51:24,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:24,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:51:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:24,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:51:24,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:51:24,277 INFO L87 Difference]: Start difference. First operand 1906 states and 2720 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:26,306 INFO L93 Difference]: Finished difference Result 4301 states and 6123 transitions. [2025-01-09 12:51:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:51:26,306 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 212 [2025-01-09 12:51:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:26,316 INFO L225 Difference]: With dead ends: 4301 [2025-01-09 12:51:26,316 INFO L226 Difference]: Without dead ends: 2707 [2025-01-09 12:51:26,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-01-09 12:51:26,320 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 440 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:26,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1027 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 12:51:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2025-01-09 12:51:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 1876. [2025-01-09 12:51:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1561 states have (on average 1.3830877642536836) internal successors, (2159), 1567 states have internal predecessors, (2159), 259 states have call successors, (259), 55 states have call predecessors, (259), 55 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259) [2025-01-09 12:51:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2677 transitions. [2025-01-09 12:51:26,513 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2677 transitions. Word has length 212 [2025-01-09 12:51:26,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:26,514 INFO L471 AbstractCegarLoop]: Abstraction has 1876 states and 2677 transitions. [2025-01-09 12:51:26,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2677 transitions. [2025-01-09 12:51:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 12:51:26,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:26,515 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:26,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 12:51:26,515 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:26,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1046015078, now seen corresponding path program 1 times [2025-01-09 12:51:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383817086] [2025-01-09 12:51:26,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:26,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:51:26,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:51:26,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:26,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:26,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383817086] [2025-01-09 12:51:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383817086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:26,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:26,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:51:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969835462] [2025-01-09 12:51:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:26,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:51:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:26,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:51:26,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:51:26,576 INFO L87 Difference]: Start difference. First operand 1876 states and 2677 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:26,887 INFO L93 Difference]: Finished difference Result 5039 states and 7151 transitions. [2025-01-09 12:51:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:51:26,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 212 [2025-01-09 12:51:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:26,898 INFO L225 Difference]: With dead ends: 5039 [2025-01-09 12:51:26,898 INFO L226 Difference]: Without dead ends: 3328 [2025-01-09 12:51:26,900 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 12:51:26,900 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 87 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:26,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 369 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:51:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2025-01-09 12:51:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3287. [2025-01-09 12:51:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 2696 states have (on average 1.3571958456973294) internal successors, (3659), 2708 states have internal predecessors, (3659), 487 states have call successors, (487), 103 states have call predecessors, (487), 103 states have return successors, (487), 475 states have call predecessors, (487), 487 states have call successors, (487) [2025-01-09 12:51:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 4633 transitions. [2025-01-09 12:51:27,212 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 4633 transitions. Word has length 212 [2025-01-09 12:51:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:27,212 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 4633 transitions. [2025-01-09 12:51:27,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 4633 transitions. [2025-01-09 12:51:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 12:51:27,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:27,213 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:27,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 12:51:27,214 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:27,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:27,214 INFO L85 PathProgramCache]: Analyzing trace with hash -365956708, now seen corresponding path program 1 times [2025-01-09 12:51:27,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:27,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899717010] [2025-01-09 12:51:27,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:27,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:27,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 12:51:27,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 12:51:27,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:27,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899717010] [2025-01-09 12:51:29,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899717010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:29,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:29,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:51:29,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877216755] [2025-01-09 12:51:29,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:29,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:51:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:29,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:51:29,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:51:29,779 INFO L87 Difference]: Start difference. First operand 3287 states and 4633 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:32,252 INFO L93 Difference]: Finished difference Result 7717 states and 10803 transitions. [2025-01-09 12:51:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:51:32,255 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 212 [2025-01-09 12:51:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:32,283 INFO L225 Difference]: With dead ends: 7717 [2025-01-09 12:51:32,283 INFO L226 Difference]: Without dead ends: 4911 [2025-01-09 12:51:32,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2025-01-09 12:51:32,293 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 600 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:32,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 969 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 12:51:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2025-01-09 12:51:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 3300. [2025-01-09 12:51:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 2709 states have (on average 1.3569582871908454) internal successors, (3676), 2721 states have internal predecessors, (3676), 487 states have call successors, (487), 103 states have call predecessors, (487), 103 states have return successors, (487), 475 states have call predecessors, (487), 487 states have call successors, (487) [2025-01-09 12:51:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4650 transitions. [2025-01-09 12:51:32,654 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4650 transitions. Word has length 212 [2025-01-09 12:51:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:32,654 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 4650 transitions. [2025-01-09 12:51:32,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:51:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4650 transitions. [2025-01-09 12:51:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 12:51:32,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:32,656 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:32,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 12:51:32,656 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:32,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2135667162, now seen corresponding path program 1 times [2025-01-09 12:51:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:32,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209086516] [2025-01-09 12:51:32,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:32,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:32,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:51:32,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:51:32,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:32,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:32,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:32,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209086516] [2025-01-09 12:51:32,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209086516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:32,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:32,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:51:32,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479850503] [2025-01-09 12:51:32,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:32,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:51:32,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:32,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:51:32,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:51:32,936 INFO L87 Difference]: Start difference. First operand 3300 states and 4650 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:51:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:33,690 INFO L93 Difference]: Finished difference Result 7458 states and 10462 transitions. [2025-01-09 12:51:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:51:33,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 213 [2025-01-09 12:51:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:33,705 INFO L225 Difference]: With dead ends: 7458 [2025-01-09 12:51:33,706 INFO L226 Difference]: Without dead ends: 4401 [2025-01-09 12:51:33,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:51:33,711 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 464 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:33,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 662 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:51:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2025-01-09 12:51:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 3332. [2025-01-09 12:51:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3332 states, 2741 states have (on average 1.3484129879605984) internal successors, (3696), 2753 states have internal predecessors, (3696), 487 states have call successors, (487), 103 states have call predecessors, (487), 103 states have return successors, (487), 475 states have call predecessors, (487), 487 states have call successors, (487) [2025-01-09 12:51:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4670 transitions. [2025-01-09 12:51:34,181 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4670 transitions. Word has length 213 [2025-01-09 12:51:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:34,181 INFO L471 AbstractCegarLoop]: Abstraction has 3332 states and 4670 transitions. [2025-01-09 12:51:34,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:51:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4670 transitions. [2025-01-09 12:51:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 12:51:34,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:34,183 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:34,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 12:51:34,183 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:34,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 879436456, now seen corresponding path program 1 times [2025-01-09 12:51:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414444101] [2025-01-09 12:51:34,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:34,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:51:34,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:51:34,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:51:34,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:51:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:51:36,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:51:36,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414444101] [2025-01-09 12:51:36,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414444101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:51:36,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:51:36,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 12:51:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699741861] [2025-01-09 12:51:36,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:51:36,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 12:51:36,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:51:36,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 12:51:36,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-01-09 12:51:36,957 INFO L87 Difference]: Start difference. First operand 3332 states and 4670 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 12:51:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:51:42,606 INFO L93 Difference]: Finished difference Result 7723 states and 10800 transitions. [2025-01-09 12:51:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 12:51:42,610 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 213 [2025-01-09 12:51:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:51:42,631 INFO L225 Difference]: With dead ends: 7723 [2025-01-09 12:51:42,631 INFO L226 Difference]: Without dead ends: 4872 [2025-01-09 12:51:42,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2025-01-09 12:51:42,645 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 899 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:51:42,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1501 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-09 12:51:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2025-01-09 12:51:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 3220. [2025-01-09 12:51:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3220 states, 2629 states have (on average 1.3457588436667935) internal successors, (3538), 2641 states have internal predecessors, (3538), 487 states have call successors, (487), 103 states have call predecessors, (487), 103 states have return successors, (487), 475 states have call predecessors, (487), 487 states have call successors, (487) [2025-01-09 12:51:43,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 3220 states and 4512 transitions. [2025-01-09 12:51:43,012 INFO L78 Accepts]: Start accepts. Automaton has 3220 states and 4512 transitions. Word has length 213 [2025-01-09 12:51:43,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:51:43,013 INFO L471 AbstractCegarLoop]: Abstraction has 3220 states and 4512 transitions. [2025-01-09 12:51:43,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-01-09 12:51:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3220 states and 4512 transitions. [2025-01-09 12:51:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 12:51:43,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:51:43,019 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:51:43,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 12:51:43,019 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:51:43,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:51:43,020 INFO L85 PathProgramCache]: Analyzing trace with hash -421273971, now seen corresponding path program 1 times [2025-01-09 12:51:43,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:51:43,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255748392] [2025-01-09 12:51:43,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:51:43,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:51:43,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.